Closest Substring Problems with Small Distances (Q3395036)

From MaRDI portal
Revision as of 12:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Closest Substring Problems with Small Distances
scientific article

    Statements

    Closest Substring Problems with Small Distances (English)
    0 references
    0 references
    0 references
    20 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    closest substring
    0 references
    consensus pattern
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractability
    0 references
    computational complexity
    0 references