Sciweavers

2 search results - page 1 / 1
» Fast Evaluation of Sequence Pair in Block Placement by Longe...
Sort
View
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
13 years 9 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
BMCBI
2004
156views more  BMCBI 2004»
13 years 4 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...