Sciweavers

7904 search results - page 298 / 1581
» Sequence Query Processing
Sort
View
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
14 years 4 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
ICDAR
2005
IEEE
14 years 4 months ago
Caption Localisation in Video Sequences by Fusion of Multiple Detectors
In this article, we focus on the problem of caption detection in video sequences. Contrary to most of existing approaches based on a single detector followed by an ad hoc and cost...
Sébastien Lefèvre, Nicole Vincent
ARC
2007
Springer
123views Hardware» more  ARC 2007»
14 years 2 months ago
Multiple Sequence Alignment Using Reconfigurable Computing
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...
Carlos R. Erig Lima, Heitor S. Lopes, Maiko R. Mor...
JPDC
2006
112views more  JPDC 2006»
13 years 10 months ago
Large scale multiple sequence alignment with simultaneous phylogeny inference
Multiple sequence alignment (MSA) and phylogenetic tree reconstruction are one of the most important problems in the computational biology. While both these problems are of great ...
Gilles Parmentier, Denis Trystram, Jaroslaw Zola
TCS
2008
13 years 10 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa