Word assembly through minimal forbidden words (Q2503298): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q405566
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marinella Sciortino / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061983309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words and special factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words, univalent factors, and boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5458488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Factors and Fragment Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words and forbidden factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank

Latest revision as of 20:23, 24 June 2024

scientific article
Language Label Description Also known as
English
Word assembly through minimal forbidden words
scientific article

    Statements

    Word assembly through minimal forbidden words (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    combinatorics on words
    0 references
    minimal forbidden word
    0 references
    factor automaton
    0 references
    fragment assembly
    0 references
    repetition index
    0 references
    shortest superstring
    0 references
    0 references