Algorithms for pattern matching and discovery in RNA secondary structure

DOI10.1016/j.tcs.2004.12.015zbMath1080.68098OpenAlexW2020982416WikidataQ57518584 ScholiaQ57518584MaRDI QIDQ1781988

Giulio Pavesi, Giancarlo Mauri

Publication date: 10 June 2005

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

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

zbMATH Keywords

RNA secondary structurePattern discoveryPattern matchingAffix trees

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Protein sequences, DNA sequences (92D20) Data structures (68P05)

Related Items (8)

Tree template matching in ranked ordered trees by pushdown automata ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ Tree template matching in unranked ordered trees ⋮ An optimal algorithm for computing all subtree repeats in trees ⋮ Computing all subtree repeats in ordered trees ⋮ Efficient pattern matching for RNA secondary structures ⋮ The affix array data structure and its applications to RNA secondary structure analysis ⋮ Tree Template Matching in Ranked Ordered Trees by Pushdown Automata

Uses Software

• Rnamotif

Cites Work

• Pattern Discovery in RNA Secondary Structure Using Affix Trees
• Algorithms on Strings, Trees and Sequences
• Unnamed Item

This page was built for publication: Algorithms for pattern matching and discovery in RNA secondary structure