Structural Analysis of Gapped Motifs of a String

DOI10.1007/978-3-540-74456-6_60MaRDI QIDQ3525611zbMATH OpenOpenAlexFDO

Authors Esko Ukkonen

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74456-6_60

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Maximal and minimal representations of gapped and non-gapped motifs of a string
• On the complexity of finding gapped motifs
• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
• Motif matching using gapped patterns
• Motif matching using gapped patterns

Cited in

(11)

• On multiple longest common subsequence and common motifs with gaps (extended abstract)
• Efficient construction of maximal and minimal representations of motifs of a string
• Motif matching using gapped patterns
• Motif matching using gapped patterns
• String Processing and Information Retrieval
• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
• Finding Common Motifs with Gaps Using Finite Automata
• Masking patterns in sequences: A new class of motif discovery with don't cares
• Maximal and minimal representations of gapped and non-gapped motifs of a string
• Suffix tree characterization of maximal motifs in biological sequences
• On the complexity of finding gapped motifs

This page was built for publication: Structural Analysis of Gapped Motifs of a String

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