Efficient computation of shortest absent words in a genomic sequence

DOI10.1016/J.IPL.2010.05.008zbMath1234.68481OpenAlexW2006514054MaRDI QIDQ765489

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

zbMATH Keywords

sequence analysisabsent wordsalgorithms on sequencesshortest absent words

Mathematics Subject Classification ID

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

Related Items (5)

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Efficient computation of shortest absent words in complete genomes ⋮ Using minimal absent words to build phylogeny ⋮ Building Phylogeny with Minimal Absent Words ⋮ Absent words in a sliding window with applications

Cites Work

• Unnamed Item
• A Space-Economical Suffix Tree Construction Algorithm
• On the Distribution of the Number of Missing Words in Random Texts

This page was built for publication: Efficient computation of shortest absent words in a genomic sequence