A practical exact maximum compatibility algorithm for reconstruction of recent evolutionary history

BMC Bioinformatics

Volumn 18, Issue 1, 2017, Pages 1-

  Cherry, Joshua L ^a  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

Bacterial genomes; Homoplasy; Maximum compatibility; Phylogeny

Indexed keywords

BACTERIA; BIOLOGY; NUCLEOTIDES;

BACTERIAL GENOMES; COMPATIBILITY CRITERIONS; COMPUTATIONAL EXPERIMENT; HOMOPLASY; MAXIMUM CLIQUE PROBLEMS; MAXIMUM COMPATIBILITY; PHYLOGENETIC RECONSTRUCTION; PHYLOGENY;

GENES;

ALGORITHM; BACTERIAL GENOME; CLASSIFICATION; DNA SEQUENCE; GENETICS; MOLECULAR EVOLUTION; PHYLOGENY; SALMONELLA ENTERICA; SOFTWARE;

ALGORITHMS; EVOLUTION, MOLECULAR; GENOME, BACTERIAL; PHYLOGENY; SALMONELLA ENTERICA; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 85013767346     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/s12859-017-1520-4     Document Type: Article

References (22)

1. Le Quesne WJ. A method of selection of characters in numerical taxonomy. Syst Zool. 1969;18:201-5.
2. Le Quesne WJ. Further studies based on the uniquely derived character concept. Syst Zool. 1972;21:281-8.
3. Zhou Z, McCann A, Litrup E, Murphy R, Cormican M, Fanning S, et al. Neutral genomic microevolution of a recently emerged pathogen, Salmonella enterica serovar Agona. PLoS Genet. 2013;9(4):e1003471.
4. Felsenstein J. A Likelihood Approach to Character Weighting and What it Tells us about Parsimony and Compatibility. Biol J Linn Soc. 1981;16:183-96.
5. Scotland RW, Steel M. Circumstances in which parsimony but not compatibility will be provably misleading. Syst Biol. 2015;64:492-504.
6. Gupta RS, Sneath PHA. Application of the character compatibility approach to generalized molecular sequence data: branching order of the proteobacterial subdivisions. J Mol Evol. 2007;64:90-100.
7. McMorris FR. On the Compatibility of Binary Qualitative Taxonomic Characters. Bull Math Biol. 1977;39:133-8.
8. Karp RM. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, editors. Complexity of Computer Computations. New York: Plenum Press; 1972. p. 85-103.
9. Wu Q, Hao JK. A review on algorithms for maximum clique problems. Eur J Oper Res. 2015;242:693-709.
10. Carraghan R, Pardalos PM. An Exact Algorithm for the Maximum Clique Problem. Oper Res Lett. 1990;9:375-82.
11. Tomita E, Yamada M. An algorithm for finding a maximum complete subgraph. Conference Records of IECE (Technical Report of the National Convention of IECE 1978). 1978. p. 8.
12. Östergård PRJ. A fast algorithm for the maximum clique problem. Discret Appl Math. 2002;120:197-207.
13. Meacham CA. Theoretical and computational considerations of the compatibility of qualitative taxonomic characters. In: Felsenstein J, editor. Numerical Taxonomy, NATO ASI Series Vol. G1. Berlin: Springer-Verlag; 1983. p. 304-14.
14. SWIG website. http://www.swig.org/. Accessed 25 Oct 2016.
15. Source code and data from this article. http://ftp.ncbi.nih.gov/pub/jcherry/compat/. Accessed 25 Oct 2016.
16. NCBI Pathogen Detection Homepage. http://www.ncbi.nlm.nih.gov/pathogens/. Accessed 25 Oct 2016.
17. Klimke W. The NCBI Pathogen Analysis Pipeline to Support Real Time Sequencing of Foodborne Pathogens (slides). http://www.slideshare.net/ExternalEvents/the-national-center-for-biotechnology-information-ncbi-pathogen-analysis-pipeline-to-support-real-time-sequencing-of-foodborne-pathogens. Accessed 25 Oct 2016.
18. Goloboff P, Farris J, Nixon K. TNT: a free program for phylogenetic analysis. Cladistics. 2008;24:774-86.
19. Felsenstein J. PHYLIP (Phylogeny Inference Package) version 3.6. 2005; Distributed by the author. Department of Genome Sciences, University of Washington, Seattle.
20. Östergård PRJ. A new algorithm for the maximum-weight clique problem. Electron Notes Discrete Math. 1999;3:153-6.
21. Cliquer homepage. https://users.aalto.fi/~pat/cliquer.html. Accessed 25 Oct 2016.
22. Croucher NJ, Harris SR, Fraser C, Quail MA, Burton J, van der Linden M, et al. Rapid pneumococcal evolution in response to clinical interventions. Science. 2011;331(6016):430-4.