Amanote Research

Amanote Research

    RegisterSign In

Faster Algorithms for RNA-Folding Using the Four-Russians Method

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-40453-5_11
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2013

Authors
Balaji VenkatachalamDan GusfieldYelena Frid
Publisher

Springer Berlin Heidelberg


Related search

Faster Update Time for Turnstile Streaming Algorithms

2020English

The RNA-Folding Problem

2019English

Genetic Algorithms for Protein Folding Simulations

Journal of Molecular Biology
Structural BiologyMolecular BiologyBiophysics
1993English

Performance Optimization of Monopole Four-Square Array Antenna Using the Method of Genetic Algorithms

2007English

Faster Algorithms for 1-Mappability of a Sequence

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2020English

Faster Algebraic Algorithms for Path and Packing Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

English

Exploring the RNA Folding Energy Landscape Using Scalable Distributed Cyberinfrastructure

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy