Using minimal absent words to build phylogeny

DOI10.1016/J.TCS.2012.04.031MaRDI QIDQ442159zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Supaporn Chairungsee, Maxime Crochemore

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

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

Recommendations

• Building phylogeny with minimal absent words
• Alignment-free sequence comparison using absent words
• Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
• Efficient computation of shortest absent words in complete genomes
• Minimal absent words in a sliding window and applications to on-line pattern matching

Cites work

• scientific article; zbMATH DE number 1998341 (Why is no real title available?)
• Algorithmic aspects of bioinformatics. Translated from the German original
• Algorithms on Strings
• Automata and forbidden words
• Efficient computation of shortest absent words in a genomic sequence
• Minimal forbidden words and symbolic dynamics

Cited in

(21)

• Music Corpus Analysis Using Unwords
• Building phylogeny with minimal absent words
• Absent words in a sliding window with applications
• Absent subsequences in words
• An estimator for local analysis of genome based on the minimal absent word
• Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
• Fast detection of specific fragments against a set of sequences
• Forty Years of Text Indexing
• Reverse-safe text indexing
• Absent Subsequences in Words
• Combinatorics of minimal absent words for a sliding window
• Can formal languages help pangenomics to represent and analyze multiple genomes?
• Constructing antidictionaries of long texts in output-sensitive space
• Internal shortest absent word queries in constant time and linear space
• Minimal absent words in a sliding window and applications to on-line pattern matching
• Palindromic trees for a sliding window and its applications
• Alignment-free sequence comparison using absent words
• On the structure of bispecial Sturmian words
• Minimal absent words in rooted and unrooted trees
• Efficient computation of shortest absent words in complete genomes
• Linear-time computation of generalized minimal absent words for multiple strings

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

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