Sparse RNA folding: time and space efficient algorithms (Q533404): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mfold / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CONTRAfold / 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.2010.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064714768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: New clique and independent set algorithms for circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse RNA Folding: Time and Space Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biological Sequence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in bioinformatics. 10th international workshop, WABI 2010, Liverpool, UK, September 6--8, 2010. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Context-Free Recognizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNA secondary structure: a complete mathematical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Accessible Motifs and RNA Folding Complexity / 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 00:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Sparse RNA folding: time and space efficient algorithms
scientific article

    Statements

    Sparse RNA folding: time and space efficient algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2011
    0 references
    RNA folding
    0 references
    time complexity
    0 references
    space complexity
    0 references
    dynamic programming
    0 references
    sparsification
    0 references
    0 references
    0 references

    Identifiers