Using minimal absent words to build phylogeny

DOI10.1016/j.tcs.2012.04.031zbMath1243.68332OpenAlexW2075847813WikidataQ61677880 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 wordsminimal absent wordsphylogeny constructionstring similaritytrie of bounded depth

Mathematics Subject Classification ID

Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (17)

On the structure of bispecial Sturmian words ⋮ Combinatorics of minimal absent words for a sliding window ⋮ Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ A framework for space-efficient string kernels ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Reverse-Safe Text Indexing ⋮ Fast detection of specific fragments against a set of sequences ⋮ Absent Subsequences in Words ⋮ Efficient computation of shortest absent words in complete genomes ⋮ Absent subsequences in words ⋮ Minimal Unique Substrings and Minimal Absent Words in a Sliding Window ⋮ Palindromic trees for a sliding window and its applications ⋮ Forty Years of Text Indexing ⋮ Minimal forbidden factors of circular words ⋮ Alignment-free sequence comparison using absent words ⋮ Absent words in a sliding window with applications ⋮ Music Corpus Analysis Using Unwords

Cites Work

• 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
• Unnamed Item

This page was built for publication: Using minimal absent words to build phylogeny