— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
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...
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 ...
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
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...