Building Phylogeny with Minimal Absent Words

DOI10.1007/978-3-642-22256-6_10zbMath1297.68277OpenAlexW85215559MaRDI QIDQ5200056

Maxime Crochemore, Supaporn Chairungsee

Publication date: 29 July 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_10

zbMATH Keywords

indexingforbidden wordsminimal absent wordsphylogeny constructionstring similaritysuffix trie of bounded depth

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Automata and forbidden words
• Efficient computation of shortest absent words in a genomic sequence
• Algorithmic aspects of bioinformatics. Translated from the German original
• Minimal forbidden words and symbolic dynamics
• Algorithms on Strings
• Bioinformatics

This page was built for publication: Building Phylogeny with Minimal Absent Words