Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2004.08.015 / 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.jda.2004.08.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084313588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of strings: median string is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient methods for multiple sequence alignment with guaranteed error bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for tree alignment with a given phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing string selection problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding similar regions in many strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding similar regions in many sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closest string and substring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of the Centre and Median String Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Mutation Trees of Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The consensus string problem for a metric is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Tree Alignment / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2004.08.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:58, 19 December 2024

scientific article
Language Label Description Also known as
English
Hardness results for the center and median string problems under the weighted and unweighted edit distances
scientific article

    Statements

    Hardness results for the center and median string problems under the weighted and unweighted edit distances (English)
    0 references
    0 references
    0 references
    27 October 2005
    0 references
    concensus string
    0 references
    multiple alignment
    0 references
    tree alignment
    0 references
    NP-complete
    0 references
    parameterized complexity
    0 references
    LCS
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references