Sciweavers

9 search results - page 1 / 2
» A fast parallel algorithm for finding the longest common seq...
Sort
View
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
15 years 8 months ago
A reconfigurable architecture for scanning biosequence databases
—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...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...
CIBCB
2007
IEEE
15 years 9 months ago
Multiple Sequence Alignment using Fuzzy Logic
—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...
Sara Nasser, Gregory Vert, Monica N. Nicolescu, Al...
BMCBI
2004
156views more  BMCBI 2004»
15 years 2 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
15 years 6 months ago
Approximation of RNA Multiple Structural Alignment
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...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...