• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (5050966)   Today's Articles (16)
For: Kelk S, Pardi F, Scornavacca C, van Iersel L. Finding a most parsimonious or likely tree in a network with respect to an alignment. J Math Biol 2019;78:527-47. [PMID: 30121824 DOI: 10.1007/s00285-018-1282-2] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/13/2017] [Revised: 05/16/2018] [Indexed: 11/22/2022]
Number Cited by Other Article(s)
1
Döcker J, Linz S, Wicke K. Bounding the Softwired Parsimony Score of a Phylogenetic Network. Bull Math Biol 2024;86:121. [PMID: 39174812 PMCID: PMC11341636 DOI: 10.1007/s11538-024-01350-9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/29/2024] [Accepted: 08/16/2024] [Indexed: 08/24/2024]
2
Scornavacca C, Weller M. Treewidth-based algorithms for the small parsimony problem on networks. Algorithms Mol Biol 2022;17:15. [PMID: 35987645 PMCID: PMC9392953 DOI: 10.1186/s13015-022-00216-w] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/24/2022] [Accepted: 03/17/2022] [Indexed: 12/04/2022]  Open
PrevPage 1 of 1 1Next
© 2004-2025 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA