Sciweavers

473 search results - page 43 / 95
» Heapable Sequences and Subsequences
Sort
View
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
15 years 3 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
WWW
2008
ACM
16 years 4 months ago
Mining, indexing, and searching for textual chemical molecule information on the web
Current search engines do not support user searches for chemical entities (chemical names and formulae) beyond simple keyword searches. Usually a chemical molecule can be represen...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
NAR
2008
101views more  NAR 2008»
15 years 3 months ago
PVS: a web server for protein sequence variability analysis tuned to facilitate conserved epitope discovery
We have developed PVS (Protein Variability Server), a web-based tool that uses several variability metrics to compute the absolute site variability in multiple protein-sequence al...
Maria Garcia-Boronat, Carmen M. Diez-Rivero, Ellis...
WOB
2004
120views Bioinformatics» more  WOB 2004»
15 years 5 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
136
Voted
BMCBI
2007
107views more  BMCBI 2007»
15 years 4 months ago
Progressive multiple sequence alignments from triplets
Motivation: The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step c...
Matthias Kruspe, Peter F. Stadler