Sciweavers

391 search results - page 28 / 79
» Aligning Two Fragmented Sequences
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
Accelerating error correction in high-throughput short-read DNA sequencing data with CUDA
Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are signif...
Haixiang Shi, Bertil Schmidt, Weiguo Liu, Wolfgang...
SCVMA
2004
Springer
14 years 3 months ago
Segregation of Moving Objects Using Elastic Matching
We present a method for figure-ground segregation of moving objects from monocular video sequences. The approach is based on tracking extracted contour fragments, in contrast to ...
Vishal Jain, Benjamin B. Kimia, Joseph L. Mundy
IPPS
2010
IEEE
13 years 7 months ago
Fast Smith-Waterman hardware implementation
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
Zubair Nawaz, Koen Bertels, Huseyin Ekin Sumbul
CF
2007
ACM
14 years 1 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
BIOCOMP
2008
13 years 11 months ago
Bioinformatics Tools: Searching for Markers in DNA/RNA Sequences
Research in bioinformatics and computational biology relies heavily on algorithms that facilitate the understanding of biological processes through the application of statistical ...
Kuha Mahalingam, Omar Bagasra