Sciweavers

5316 search results - page 1000 / 1064
» Which Search Problems Are Random
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
15 years 29 days ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
136
Voted
BMCBI
2008
214views more  BMCBI 2008»
15 years 29 days ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
108
Voted
BMCBI
2008
120views more  BMCBI 2008»
15 years 29 days ago
Statistical issues in the analysis of Illumina data
Background: Illumina bead-based arrays are becoming increasingly popular due to their high degree of replication and reported high data quality. However, little attention has been...
Mark J. Dunning, Nuno L. Barbosa-Morais, Andy G. L...
BMCBI
2008
86views more  BMCBI 2008»
15 years 29 days ago
Subfamily specific conservation profiles for proteins based on n-gram patterns
Background: A new algorithm has been developed for generating conservation profiles that reflect the evolutionary history of the subfamily associated with a query sequence. It is ...
John K. Vries, Xiong Liu
93
Voted
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 28 days ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
« Prev « First page 1000 / 1064 Last » Next »