The complexity of multiple sequence alignment with SP-score that is a metric (Q5941270): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Approximation algorithms for multiple sequence alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple Sequence Alignment Problem in Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of multiple sequence comparison methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Mapping the genome / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:23, 3 June 2024

scientific article; zbMATH DE number 1635435
Language Label Description Also known as
English
The complexity of multiple sequence alignment with SP-score that is a metric
scientific article; zbMATH DE number 1635435

    Statements

    The complexity of multiple sequence alignment with SP-score that is a metric (English)
    0 references
    0 references
    0 references
    20 August 2001
    0 references
    0 references
    multiple sequence alignment
    0 references
    SP-score
    0 references
    intractability
    0 references