On some algorithmic problems regarding the hairpin completion (Q1026117): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.dam.2007.09.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180809675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superposition based on Watson-Crick-like complementarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAIRPIN LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and parsing of context-free languages in time n3 / rank
 
Normal rank

Latest revision as of 17:34, 1 July 2024

scientific article
Language Label Description Also known as
English
On some algorithmic problems regarding the hairpin completion
scientific article

    Statements

    On some algorithmic problems regarding the hairpin completion (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2009
    0 references
    0 references
    hairpin completion
    0 references
    iterated hairpin completion
    0 references
    membership problem
    0 references
    hairpin completion distance
    0 references
    0 references