9 search results - page 1 / 2 » A fast parallel algorithm for finding the longest common seq... |
BMCBI
2006
13 years 5 months ago
2006
ISCAS
2005
IEEE
13 years 10 months ago
2005
IEEE
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
CIBCB
2007
IEEE
13 years 11 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
BMCBI
2004
13 years 4 months ago
2004
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...