A New Linear-Time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks: Theoretical Bounds and Empirical Performance-Reference-Cited by-同舟云学术

A New Linear-Time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks: Theoretical Bounds and Empirical Performance

Published: Issue: Volume: Page:61-72
ISSN:
Container-title:Bioinformatics Research and Applications
language:
Short-container-title:

Author:

Jin Guohua,Nakhleh Luay,Snir Sagi,Tuller Tamir

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72031-7_6.pdf

Reference36 articles.

1. Lecture Notes in Bioinformatics;V. Bafna,2005

2. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. on Discrete Mathematics 12, 289–297 (1999)

3. Bar-Yehuda, R.: One for the price of two: A unified approach for approximating covering problems. Algorithmica 27, 131–144 (2000)

4. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)

5. Bergthorsson, U., et al.: Widespread horizontal transfer of mitochondrial genes in flowering plants. Nature 424, 197–201 (2003)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Advances in Computational Methods for Phylogenetic Networks in the Presence of Hybridization;Bioinformatics and Phylogenetics;2019

2. Maximum Parsimony on Phylogenetic networks;Algorithms for Molecular Biology;2012-05-02

3. Bootstrap-based Support of HGT Inferred by Maximum Parsimony;BMC Evolutionary Biology;2010-05-05

4. Evolutionary Phylogenetic Networks: Models and Issues;Problem Solving Handbook in Computational Biology and Bioinformatics;2010

5. References;Meta-analysis and Combining Information in Genetics and Genomics;2009-07-07