Sciweavers

662 search results - page 56 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
BMCBI
2007
142views more  BMCBI 2007»
13 years 7 months ago
SABERTOOTH: protein structural alignment based on a vectorial structure representation
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
Florian Teichert, Ugo Bastolla, Markus Porto
DEXA
2005
Springer
110views Database» more  DEXA 2005»
14 years 1 months ago
Intensional Encapsulations of Database Subsets via Genetic Programming
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
Aybar C. Acar, Amihai Motro
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
14 years 6 days ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
BMCBI
2006
178views more  BMCBI 2006»
13 years 7 months ago
MannDB - A microbial database of automated protein sequence analyses and evidence integration for protein characterization
Background: MannDB was created to meet a need for rapid, comprehensive automated protein sequence analyses to support selection of proteins suitable as targets for driving the dev...
Carol L. Ecale Zhou, Marisa Lam, Jason Smith, Adam...
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong