Sciweavers

8431 search results - page 174 / 1687
» Algorithmically Independent Sequences
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 8 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
15 years 8 months ago
Mining Protein Sequence Motifs Representing Common 3D Structures
Understanding the relationship between protein structure and its sequence is one of the most important tasks of current bioinformatics research. In this work, recurring protein se...
Wei Zhong, Gulsah Altun, Robert W. Harrison, Phang...
114
Voted
CVPR
1997
IEEE
15 years 6 months ago
Feature Tracking from an Image Sequence Using Geometric Invariants
In this paper two new feature tracking algorithms are proposed. In the first algorithm, a perspective camera model is used. Making use of the projective inuariant of Barrett, and ...
Hung-Tat Tsui, Zhong-Ying Zhang, Shao-Hua Kong
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
15 years 8 months ago
Discovering Frequent Poly-Regions in DNA Sequences
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios
ICASSP
2008
IEEE
15 years 8 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
Mike Novey, Tülay Adali