Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice

10.1137/S0097539793244587

10.1007/11786986_58

10.1073/pnas.0306629101

10.1073/pnas.012364999

10.1093/nar/29.1.308

10.1007/BF02618470

semple, 2003, Phylogenetics, 10.1093/oso/9780198509424.001.0001

10.1007/11758525_107

promel, 2002, The Steiner Tree Problem A Tour through Graphs Algorithms and Complexity

merimaa, 2005, Functional Co-Adaption of Phenol Hydroxylase and Catechol 2,3-Dioxygenase Genes in Bacteria Possessing Different Phenol and P-Cresol Degradation Pathways, Proc Eighth Symp Bacterial Genetics and Ecology

10.1137/S0097539794279067

gusfield, 2003, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination, Proc Second IEEE CS Computational Systems Bioinformatics Conf, 363

downey, 1999, Parameterized Complexity, 10.1007/978-1-4612-0515-9

gusfield, 2005, A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters, Proc Ninth Ann Int'l Conf Research in Computational Molecular Biology, 217, 10.1007/11415770_17

bonet, 1992, Better Methods for Solving Parsimony and Compatibility, J Computational Biology, 5, 409

2003, The International HapMap Project, Nature, 426, 789, 10.1038/nature02168

10.1016/S0304-3975(98)00342-9

10.1126/science.1105436

bodlaender, 1992, Two Strikes against Perfect Phylogeny, Proc 19th Int'l Colloquium on Automata Languages and Programming, 273, 10.1007/3-540-55719-9_80

10.1142/S0219720003000174

10.1007/978-3-540-28639-4_1

10.2307/2413432

10.1137/S0097539799350839

felsenstein, 2005

ganapathy, 2003, Better Hill-Climbing Searches for Parsimony, Proc Third Int'l Workshop Algorithms in Bioinformatics (WABI '03), 254

10.1016/S0196-8858(82)80004-3

gusfield, 1999, Algorithms on Strings Trees and Sequences

10.1002/net.3230210104