Construction of minimal deterministic finite automata from biological motifs

DOI10.1016/J.TCS.2010.12.003zbMATH Open1206.68176OpenAlexW1979702187MaRDI QIDQ627199FDOQ627199

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

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

zbMATH Keywords

motifminimizationconsensus stringdeterministic finite automatongeneralized string

Mathematics Subject Classification ID

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

Cites Work

• A unified approach to word occurrence probabilities
• Motif statistics.
• Title not available (Why is that?)
• Five Determinisation Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiple pattern matching: a Markov chain approach
• Re-describing an algorithm by Hopcroft

Cited In (4)

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

Uses Software

• PROSITE
• JASPAR

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)