• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (4676890)   Today's Articles (2649)
For: Daskalakis C, Mossel E, Roch S. Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. In: Batzoglou S, editor. Research in Computational Molecular Biology. Berlin: Springer Berlin Heidelberg; 2009. pp. 451-65. [DOI: 10.1007/978-3-642-02008-7_32] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register]
Number Cited by Other Article(s)
1
Daskalakis C, Roch S. Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis. ANN APPL PROBAB 2013. [DOI: 10.1214/12-aap852] [Citation(s) in RCA: 12] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
2
Mossel E, Roch S. Phylogenetic mixtures: Concentration of measure in the large-tree limit. ANN APPL PROBAB 2012. [DOI: 10.1214/11-aap837] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
3
Mossel E, Roch S. Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies. J Math Biol 2012;67:767-97. [DOI: 10.1007/s00285-012-0571-4] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/19/2011] [Revised: 07/03/2012] [Indexed: 10/28/2022]
4
Brown DG, Truszkowski J. Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing. LECTURE NOTES IN COMPUTER SCIENCE 2012. [DOI: 10.1007/978-3-642-33122-0_2] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/07/2023]
5
Towards a Practical O(n logn) Phylogeny Algorithm. LECTURE NOTES IN COMPUTER SCIENCE 2011. [DOI: 10.1007/978-3-642-23038-7_2] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/31/2023]
PrevPage 1 of 1 1Next
© 2004-2025 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA