Efficient Enumeration of Phylogenetically Informative Substrings

DOI10.1007/11732990_22MaRDI QIDQ3596267zbMATH OpenOpenAlexFDO

Authors Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim

Publication date 30 August 2007

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

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

zbMATH Keywords

informative substringsphylogenetic treesuffix-tree based algorithm

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Recommendations

• An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
• Algorithms and Computation
• Minimizing phylogenetic number to find good evolutionary trees
• Comparison of alignment free string distances for complete genome phylogeny
• Research in Computational Molecular Biology

Cited in

(3)

• Algorithms and Computation
• Efficient computation of shortest absent words in a genomic sequence
• An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation

This page was built for publication: Efficient Enumeration of Phylogenetically Informative Substrings

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