类 型
11 篇文献
 
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment  
Computational alignment of a biopolymer sequence (e.g., an RNA or a protein) to a structure is an effective approach to predict and search for the structure of new sequences. To identify the structure......
IEEE/ACM Transactions on Computational Biology and Bioinformatics  2006
4次引用 0 0
Fast and accurate search for non-coding RNA pseudoknot structures in genomes  
Motivation: Searching genomes for non-coding RNAs (ncRNAs) by their secondary structure has become an important goal for bioinformatics. For pseudoknot-free structures, ncRNA search can be effective b......
Bioinformatics/computer Applications in The Biosciences  2008
3次引用 0 0
Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment  
Abstract. Computational alignment of a biopolymer sequence (e.g., an RNA or a protein) to a structure is an effective approach to predict and search for the structure of new sequences. To identify the......
Algorithms in Bioinformatics  2005
6次引用 0 0
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming  
We propose a simple and effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced “anchor technique ” is based on a tree......
Cologne Twente Workshop on Graphs and Combinatorical Optimization  2004
2次引用 0 0
Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems  
Fixed-parameter algorithms can efficiently find optimal solutions to some computationally hard (NP-hard) problems. We survey five main practical techniques to develop such algorithms. Each technique i......
2次引用 0 0
EFFICIENT ANNOTATION OF NON-CODING RNA STRUCTURES INCLUDING PSEUDOKNOTS VIA AUTOMATED FILTERS  
Computational search of genomes for RNA secondary structure is an important approach to the annotation of non-coding RNAs. The bottleneck of the search is sequence-structure alignment, which is often ......
0次引用 0 0
Rapid ab initio RNA Folding Including Pseudoknots via Graph Tree Decomposition  
Abstract. The prediction of RNA secondary structure including pseudoknots remains a challenge due to the intractable computation of the sequence conformation from intriguing nucleotide interactions. O......
Algorithms in Bioinformatics  2006
3次引用 0 0
Graph algorithms for biological systems analysis  
The post-genomic era has witnessed an explosion in the quality, quantity and variety of biological data---sequence, structure, and networks. However, when building computational models on these data, ......
ACM-SIAM Symposium on Discrete Algorithms  2008
1次引用 0 0
Aide totale demandée  
Titre du projet en français Titre du projet en anglais CSD principale CSD secondaire (si interdisciplinarité) Algorithmes de graphes paramétrés et exacts Parameterized and exact graph algorithms......
0次引用 0 0
Rapid ab initio Prediction of RNA Pseudoknots via Graph Tree Decomposition  
The prediction of RNA secondary structure including pseudoknots remains a challenge due to the intractable computation of the sequence conformation from nucleotide interactions under free energy model......
0次引用 0 0

1/2 第一页 上一页 1 2 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜