Generalization of a suffix tree for RNA structural pattern matching

DOI10.1007/S00453-003-1067-9MaRDI QIDQ1879353zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1617275
• On-line construction of suffix trees
• Efficient pattern matching for RNA secondary structures
• Algorithms for pattern matching and discovery in RNA secondary structure
• Pattern Discovery in RNA Secondary Structure Using Affix Trees

Cited in

(23)

• Large-scale frequent stem pattern mining in RNA families
• Variations of the parameterized longest previous factor
• p-suffix sorting as arithmetic coding
• On-line construction of parameterized suffix trees for large alphabets
• Practical space-efficient index for structural pattern matching
• A brief history of parameterized matching problems
• Counter based suffix tree for DNA pattern repeats
• The affix array data structure and its applications to RNA secondary structure analysis
• Secure parameterized pattern matching
• Parameterized DAWGs: efficient constructions and bidirectional pattern searches
• The parameterized suffix tray
• scientific article; zbMATH DE number 1617275 (Why is no real title available?)
• Pattern Discovery in RNA Secondary Structure Using Affix Trees
• Counting Parameterized Border Arrays for a Binary Alphabet
• The structural border array
• Parameterized longest previous factor
• Efficient pattern matching for RNA secondary structures
• A prefix array for parameterized strings
• Computing the parameterized Burrows-Wheeler transform online
• Verifying and enumerating parameterized border arrays
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
• Computing maximal palindromes in non-standard matching models
• Compressed parameterized pattern matching

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879353)