Construction of minimal deterministic finite automata from biological motifs (Q627199): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple pattern matching: a Markov chain approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4534878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motif statistics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to word occurrence probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five Determinisation Algorithms / rank
 
Normal rank

Latest revision as of 19:45, 3 July 2024

scientific article
Language Label Description Also known as
English
Construction of minimal deterministic finite automata from biological motifs
scientific article

    Statements

    Construction of minimal deterministic finite automata from biological motifs (English)
    0 references
    0 references
    21 February 2011
    0 references
    0 references
    motif
    0 references
    deterministic finite automaton
    0 references
    minimization
    0 references
    consensus string
    0 references
    generalized string
    0 references
    0 references
    0 references
    0 references