Using minimal absent words to build phylogeny
From MaRDI portal
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
- 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
- scientific article; zbMATH DE number 1998341 (Why is no real title available?)
- Minimal forbidden words and symbolic dynamics
Cited in
(26)- Minimal absent words in a sliding window and applications to on-line pattern matching
- Alignment-free sequence comparison using absent words
- Constructing antidictionaries of long texts in output-sensitive space
- Combinatorics of minimal absent words for a sliding window
- Can formal languages help pangenomics to represent and analyze multiple genomes?
- 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
- 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
- Forty Years of Text Indexing
- Reverse-safe text indexing
- Building phylogeny with minimal absent words
- Music Corpus Analysis Using Unwords
- Fast detection of specific fragments against a set of sequences
- Absent Subsequences in Words
- Minimal absent words in rooted and unrooted trees
- Linear-time computation of generalized minimal absent words for multiple strings
- Double-ended palindromic trees in linear time
- An efficient implementation of cosine distance on minimal absent word sets using suffix automata
- Computing minimal absent words and extended bispecial factors with CDAWG space
- Efficient computation of discriminative absent words for string collections
- Transformations between minimally f-free words
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)
