Optimal Computation of Overabundant Words

DOI10.4230/LIPIcs.WABI.2017.4zbMath1443.92133arXiv1705.03385OpenAlexW2963163208MaRDI QIDQ5111793

Costas S. Iliopoulos, Dimitris Polychronopoulos, Manal Mohamed, Jia Gao, Solon P. Pissis, Panagiotis Charalampopoulos, Yannis Almirantis

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1705.03385

zbMATH Keywords

suffix treeDNA sequence analysisavoided wordsoverabundant words

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

On overabundant words and their application to biological sequence analysis

Cites Work

• A framework for space-efficient string kernels
• Optimal computation of avoided words
• Assessing the Statistical Significance of Overrepresented Oligonucleotides
• Algorithms on Strings

This page was built for publication: Optimal Computation of Overabundant Words