Generalization of a suffix tree for RNA structural pattern matching

DOI10.1007/s00453-003-1067-9zbMath1089.68031OpenAlexW1982137958MaRDI QIDQ1879353

Tetsuo Shibuya

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1067-9

zbMATH Keywords

computational biology

Mathematics Subject Classification ID

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

Related Items (16)

Practical space-efficient index for structural pattern matching ⋮ Secure parameterized pattern matching ⋮ The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Parameterized DAWGs: efficient constructions and bidirectional pattern searches ⋮ Compressed parameterized pattern matching ⋮ Computing the parameterized Burrows-Wheeler transform online ⋮ On-line construction of parameterized suffix trees for large alphabets ⋮ The parameterized suffix tray ⋮ Parameterized longest previous factor ⋮ Verifying and enumerating parameterized border arrays ⋮ Efficient pattern matching for RNA secondary structures ⋮ A prefix array for parameterized strings ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A brief history of parameterized matching problems

This page was built for publication: Generalization of a suffix tree for RNA structural pattern matching