Combinatorial Pattern Matching

DOI10.1007/B98377MaRDI QIDQ5315331zbMATH OpenFDO

Authors Arvind Kumar Gupta, Ján Maňuch, Ladislav Stacho, Chenchen Zhu

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B98377

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimizing phylogenetic number to find good evolutionary trees
• Reconstructing ancestral character states under Wagner parsimony
• Algorithms for phylogeny reconstruction in a new mathematical model
• A more efficient algorithm for MPR problems in phylogeny
• A subdivision approach to maximum parsimony

Cited in

(12)

• Treewidth-Based Algorithms for the Small Parsimony Problem on Networks
• Four Characters Suffice to Convexly Define a Phylogenetic Tree
• Parsimonious migration history problem: complexity and algorithms
• Character-based phylogeny construction and its application to tumor evolution
• Generalizations on the parsimony question in evolution
• Extracting coevolving characters from a tree of species
• Jungles: A new solution to the host/parasite phylogeny reconciliation problem
• Representing and extending ensembles of parsimonious evolutionary histories with a directed acyclic graph
• Reconstructing ancestral character states under Wagner parsimony
• Leveraging constraints plus dynamic programming for the large Dollo parsimony problem
• Parametric maximum parsimonious reconstruction on trees
• A subdivision approach to maximum parsimony

This page was built for publication: Combinatorial Pattern Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315331)