Efficient computation of shortest absent words in a genomic sequence
From MaRDI portal
Publication:765489
DOI10.1016/J.IPL.2010.05.008zbMATH Open1234.68481OpenAlexW2006514054MaRDI QIDQ765489FDOQ765489
Tao Jiang, Zong-Da Wu, Wu-Jie Su
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.008
Cites Work
Cited In (8)
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
- Absent words in a sliding window with applications
- Title not available (Why is that?)
- 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
- Building Phylogeny with Minimal Absent Words
- Efficient computation of shortest absent words in complete genomes
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 👍 👎
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)
