66 search results - page 5 / 14 » Cache-Oblivious Dynamic Programming for Bioinformatics |
WABI
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. In this paper we propose a chaining method that can align a draft genomic sequence against a finished genome. We introduce the use of an overlap tree to enhance the state...
BIOCOMP
2006
13 years 8 months ago
2006
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
BIBE
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...