Construction of minimal deterministic finite automata from biological motifs

DOI10.1016/j.tcs.2010.12.003zbMath1206.68176OpenAlexW1979702187MaRDI QIDQ627199

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

motifminimizationconsensus stringdeterministic finite automatongeneralized string

Mathematics Subject Classification ID

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

Related Items (2)

Stochastic analysis of minimal automata growth for generalized strings ⋮ Approximation of sojourn-times via maximal couplings: motif frequency distributions

Uses Software

• PROSITE
• JASPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple pattern matching: a Markov chain approach
• A unified approach to word occurrence probabilities
• Re-describing an algorithm by Hopcroft
• Motif statistics.
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
• Five Determinisation Algorithms

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