Sciweavers

310 search results - page 24 / 62
» Using Parallel Algorithms for Searching Molecular Sequence D...
Sort
View
BMCBI
2005
109views more  BMCBI 2005»
13 years 8 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
IFIP
2001
Springer
14 years 1 months ago
A New Efficient VLSI Architecture for Full Search Block Matching Motion Estimation
: A new efficient type I architecture for motion estimation in video sequences based on the Full-Search Block-Matching (FSBM) algorithm is proposed in this paper. This architecture...
Nuno Roma, Leonel Sousa
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
14 years 10 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
BIOCOMP
2009
13 years 10 months ago
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
Gina Cooper, Michael L. Raymer
IANDC
2011
148views more  IANDC 2011»
13 years 3 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez