Counter based suffix tree for DNA pattern repeats

DOI10.1016/j.tcs.2019.12.014zbMath1435.68070OpenAlexW2999678769WikidataQ126345153 ScholiaQ126345153MaRDI QIDQ2304543

Dimane Mpoeleng, Tshepo Kitso Gobonamang

Publication date: 12 March 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.014

zbMATH Keywords

bioinformaticssuffix treegenomegenescounter-based suffix treenucleic bases

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Data structures (68P05)

Related Items (1)

Constructing generalized suffix trees on distributed parallel platforms

Uses Software

• RepeatMasker
• REPuter
• IDBA

Cites Work

• Parallel construction of a suffix tree with applications
• IDBA
• On-line construction of suffix trees
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Obtaining Provably Good Performance from Suffix Trees in Secondary Storage

This page was built for publication: Counter based suffix tree for DNA pattern repeats