Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
From MaRDI portal
The author presents a new algorithm for biological sequences solving simultaneously three tasks: the alignment of finite sequences, the inference of RNA secondary structure and the construction of a phylogenetic tree. The algorithm works in time proportional to \(n^{3N}\) and storage \(n^{2N}\) where N is the number of sequences and n is their maximal length.
Recommendations
- scientific article; zbMATH DE number 4116367
- Rapid dynamic programming algorithms for RNA secondary structure
- A computational model for RNA multiple structural alignment
- scientific article; zbMATH DE number 826057
- A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment
Cited in
(34)- Rapid dynamic programming algorithms for RNA secondary structure
- The parameterized complexity of sequence alignment and consensus
- Approximation algorithms for multiple sequence alignment
- A polyhedral approach to sequence alignment problems
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
- Modeling and predicting all- transmembrane proteins including helix-helix pairing
- The longest common subsequence problem for sequences with nested arc annotations.
- Partially local multi-way alignments
- On the power of oritatami cotranscriptional folding with unary bead sequence
- Evolutionary rate variation and RNA secondary structure prediction
- Cofolga: a genetic algorithm for finding the common folding of two RNAs
- Algebraic dynamic programming for multiple context-free grammars
- Finding common RNA secondary structures from RNA sequences
- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
- Fast RNA Structure Alignment for Crossing Input Structures
- Sparse RNA Folding: Time and Space Efficient Algorithms
- Forest alignment with affine gaps and anchors, applied in RNA structure comparison
- scientific article; zbMATH DE number 4116367 (Why is no real title available?)
- A genetic algorithm on multiple sequences alignment problems in biology
- Fast and accurate structure probability estimation for simultaneous alignment and folding of RNAs
- Fast RNA structure alignment for crossing input structures
- Sparse RNA folding: time and space efficient algorithms
- Consensus folding of unaligned RNA sequences revisited
- New approximation algorithms for RNA secondary structures prediction problems by local search
- Lock-free parallel dynamic programming
- A phase transition for the minimum free energy of secondary structures of a random RNA
- Towards an information-theoretic framework for multiple sequence alignment sub-sampling
- The longest common subsequence problem for arc-annotated sequences
- Speeding up the dynamic algorithm for planar RNA folding
- A parallel algorithm for estimating the secondary structure in ribonucleic acids
- Computational methods in noncoding RNA research
- Variations on RNA folding and alignment: Lessons from Benasque
- PSSMTS: Position specific scoring matrices on tree structures
- Efficient sequence alignment with side-constraints by cluster tree elimination
This page was built for publication: Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705254)