Finding Common Motifs with Gaps Using Finite Automata

DOI10.1007/11812128_8MaRDI QIDQ5757222zbMATH OpenOpenAlexFDO

Authors Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Pierre Peterlongo, Bořivoj Melichar

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05) Algorithms on strings (68W32)

Recommendations

• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
• On multiple longest common subsequence and common motifs with gaps (extended abstract)
• scientific article; zbMATH DE number 1962790
• Structural Analysis of Gapped Motifs of a String
• Motif matching using gapped patterns

Cited in

(2)

• On multiple longest common subsequence and common motifs with gaps (extended abstract)
• The finite automata approaches in stringology

This page was built for publication: Finding Common Motifs with Gaps Using Finite Automata

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