default search action
Noah A. Rosenberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Filippo Disanto, Michael Fuchs
, Chun-Yen Huang, Ariel R. Paningbatan, Noah A. Rosenberg
The distributions under two species-tree models of the total number of ancestral configurations for matching gene trees and species trees. Adv. Appl. Math. 152: 102594 (2024) - [j28]Alessandra Rister Portinari Maranca, Noah A. Rosenberg
Bijections between the multifurcating unlabeled rooted trees and the positive integers. Adv. Appl. Math. 153: 102612 (2024) - [j27]Theodore D. Gress, Noah A. Rosenberg
Mathematical constraints on a family of biodiversity measures via connections with Rényi entropy. Biosyst. 237: 105153 (2024) - [j26]Egor Lappo
A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees. Discret. Appl. Math. 343: 65-81 (2024) - [c5]Michael R. Doboli, Hsien-Kuei Hwang, Noah A. Rosenberg:
Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves. AofA 2024: 18:1-18:14 - [c4]Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, Noah A. Rosenberg:
Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls. AofA 2024: 27:1-27:14 - 2023
- [j25]Shaili Mathur, Noah A. Rosenberg
All galls are divided into three or more parts: recursive enumeration of labeled histories for galled trees. Algorithms Mol. Biol. 18(1): 1 (2023) - [j24]Xiran Liu, Naama M. Kopelman, Noah A. Rosenberg
A Dirichlet Model of Alignment Cost in Mixed-Membership Unsupervised Clustering. J. Comput. Graph. Stat. 32(3): 1145-1159 (2023) - 2022
- [j23]Rohan S. Mehta
The Probability of Joint Monophyly of Samples of Gene Lineages for All Species in an Arbitrary Species Tree. J. Comput. Biol. 29(7): 679-703 (2022) - 2021
- [j22]Egor Alimpiev
Enumeration of coalescent histories for caterpillar species trees and p-pseudocaterpillar gene trees. Adv. Appl. Math. 131: 102265 (2021) - [j21]Noah A. Rosenberg
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees. Discret. Appl. Math. 291: 88-98 (2021) - 2020
- [j20]Zoe M. Himwich
Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees. Adv. Appl. Math. 113 (2020)
2010 – 2019
- 2019
- [j19]Noah A. Rosenberg
Enumeration of lonely pairs of gene trees and species trees by means of antipodal cherries. Adv. Appl. Math. 102: 1-17 (2019) - 2017
- [j18]Filippo Disanto, Noah A. Rosenberg
Enumeration of Ancestral Configurations for Matching Gene Trees and Species Trees. J. Comput. Biol. 24(9): 831-850 (2017) - 2016
- [j17]Lawrence H. Uricchio
An analytical upper bound on the number of loci required for all splits of a species tree to appear in a set of gene trees. BMC Bioinform. 17(S-14): 241-250 (2016) - [j16]Filippo Disanto, Noah A. Rosenberg
Asymptotic Properties of the Number of Matching Coalescent Histories for Caterpillar-Like Families of Species Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 13(5): 913-925 (2016) - 2015
- [j15]Filippo Disanto, Noah A. Rosenberg
Coalescent Histories for Lodgepole Species Trees. J. Comput. Biol. 22(10): 918-929 (2015) - [c3]Roy Ronen, Glenn Tesler, Ali Akbari, Shay Zakov, Noah A. Rosenberg
Haplotype Allele Frequency (HAF) Score: Predicting Carriers of Ongoing Selective Sweeps Without Knowledge of the Adaptive Allele. RECOMB 2015: 276-280 - 2014
- [j14]Cuong V. Than, Noah A. Rosenberg
Mean deep coalescence cost under exchangeable probability distributions. Discret. Appl. Math. 174: 11-26 (2014) - [j13]Filippo Disanto, Noah A. Rosenberg
On the Number of Ranked Species Trees Producing Anomalous Ranked Gene Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 11(6): 1229-1238 (2014) - 2013
- [j12]Cuong V. Than, Noah A. Rosenberg
Mathematical Properties of the Deep Coalescence Cost. IEEE ACM Trans. Comput. Biol. Bioinform. 10(1): 61-72 (2013) - [j11]Noah A. Rosenberg
Coalescent Histories for Caterpillar-Like Families. IEEE ACM Trans. Comput. Biol. Bioinform. 10(5): 1253-1262 (2013) - [c2]Luay Nakhleh, Noah A. Rosenberg, Tandy J. Warnow:
Session introduction. Pacific Symposium on Biocomputing 2013: 247-249 - [c1]Naama M. Kopelman, Lewi Stone, Olivier Gascuel, Noah A. Rosenberg:
The Behavior of Admixed Populations in Neighbor-Joining Inference of Population Trees. Pacific Symposium on Biocomputing 2013: 273-284 - 2012
- [j10]Ethan M. Jewett, Noah A. Rosenberg
iGLASS: An Improvement to the GLASS Method for Estimating Species Trees from Gene Trees. J. Comput. Biol. 19(3): 293-315 (2012) - [j9]Laura J. Helmkamp, Ethan M. Jewett, Noah A. Rosenberg
Improvements to a Class of Distance Matrix Methods for Inferring Species Trees from Gene Trees. J. Comput. Biol. 19(6): 632-649 (2012) - [j8]James H. Degnan, Noah A. Rosenberg
A Characterization of the Set of Species Trees that Produce Anomalous Ranked Gene Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 9(6): 1558-1568 (2012) - 2011
- [j7]Cuong V. Than, Noah A. Rosenberg
Consistency Properties of Species Tree Inference by Minimizing Deep Coalescences. J. Comput. Biol. 18(1): 1-15 (2011)
2000 – 2009
- 2008
- [j6]Zachary A. Szpiech, Mattias Jakobsson
ADZE: a rarefaction approach for counting alleles private to combinations of populations. Bioinform. 24(21): 2498-2504 (2008) - 2007
- [j5]Mattias Jakobsson
CLUMPP: a cluster matching and permutation program for dealing with label switching and multimodality in analysis of population structure. Bioinform. 23(14): 1801-1806 (2007) - [j4]Noah A. Rosenberg
Counting Coalescent Histories. J. Comput. Biol. 14(3): 360-377 (2007) - 2005
- [j3]Noah A. Rosenberg
Algorithms for Selecting Informative Marker Panels for Population Assignment. J. Comput. Biol. 12(9): 1183-1201 (2005) - [j2]Noah A. Rosenberg, Richard Bagby:
Integral over a Simplex: 11039. Am. Math. Mon. 112(6): 572-573 (2005) - 2003
- [j1]Noah A. Rosenberg, Richard Stong:
Problem 11039. Am. Math. Mon. 110(8): 743 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: