Efficient computation of shortest absent words in a genomic sequence
From MaRDI portal
(Redirected from Publication:765489)
Recommendations
- Efficient computation of shortest absent words in complete genomes
- An estimator for local analysis of genome based on the minimal absent word
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
- Alignment free comparison: similarity distribution between the DNA primary sequences based on the shortest absent word
- Combinatorial Pattern Matching
- Alignment-free sequence comparison using absent words
- Efficient Enumeration of Phylogenetically Informative Substrings
- Simple algorithm for pattern-matching with bounded gaps in genomic sequences
Cites work
Cited in
(10)- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
- Building phylogeny with minimal absent words
- Absent words in a sliding window with applications
- scientific article; zbMATH DE number 7695992 (Why is no real title available?)
- Using minimal absent words to build phylogeny
- Randomized fast design of short DNA words
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
- Optimal computation of overabundant words
- Alignment-free sequence comparison using absent words
- Efficient computation of shortest absent words in complete genomes
This page was built for publication: Efficient computation of shortest absent words in a genomic sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765489)