Construction of minimal deterministic finite automata from biological motifs

DOI10.1016/J.TCS.2010.12.003MaRDI QIDQ627199zbMATH OpenOpenAlexFDO

Authors Tobias Marschall

Publication date 21 February 2011

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

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

zbMATH Keywords

consensus stringdeterministic finite automatongeneralized stringminimizationmotif

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• Stochastic analysis of minimal automata growth for generalized strings
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• Minimal partial languages and automata
• scientific article; zbMATH DE number 2081054
• Simplifying nondeterministic finite cover automata

Cites work

• A unified approach to word occurrence probabilities
• Five Determinisation Algorithms
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Motif statistics.
• Multiple pattern matching: a Markov chain approach
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
• Re-describing an algorithm by Hopcroft

Cited in

(4)

• Stochastic analysis of minimal automata growth for generalized strings
• Minimal state automata for detecting a \(\beta\) globin gene mutation
• Approximation of sojourn-times via maximal couplings: motif frequency distributions
• Testing deterministic finite automata and non-deterministic finite automata using Java program

Describes a project that uses

Uses Software

• JASPAR
• PROSITE

This page was built for publication: Construction of minimal deterministic finite automata from biological motifs

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