Using minimal absent words to build phylogeny

DOI10.1016/j.tcs.2012.04.031zbMath1243.68332WikidataQ61677880 ScholiaQ61677880MaRDI QIDQ442159

Maxime Crochemore, Supaporn Chairungsee

Publication date: 9 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.031

zbMATH Keywords

forbidden words; minimal absent words; phylogeny construction; string similarity; trie of bounded depth

Mathematics Subject Classification ID

68R15: Combinatorics on words

92D20: Protein sequences, DNA sequences

68W32: Algorithms on strings

Related Items

Forty Years of Text Indexing, Music Corpus Analysis Using Unwords, Minimal forbidden factors of circular words, A framework for space-efficient string kernels, Alignment-free sequence comparison using absent words, Efficient computation of shortest absent words in complete genomes, Palindromic trees for a sliding window and its applications, Absent words in a sliding window with applications, On the structure of bispecial Sturmian words, Internal shortest absent word queries in constant time and linear space, Minimal Unique Substrings and Minimal Absent Words in a Sliding Window

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