A new algorithm for computing similarity between RNA structures (Q5956864): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RNAlign / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of biosequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding All Suboptimal Foldings of an RNA Molecule / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNA secondary structures and their prediction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:16, 3 June 2024

scientific article; zbMATH DE number 1713694
Language Label Description Also known as
English
A new algorithm for computing similarity between RNA structures
scientific article; zbMATH DE number 1713694

    Statements

    A new algorithm for computing similarity between RNA structures (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    RNA structures
    0 references
    similarity
    0 references