Sciweavers

1075 search results - page 39 / 215
» Comparison of Genomes Using High-Performance Parallel Comput...
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
13 years 9 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
RECOMB
2000
Springer
14 years 12 days ago
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
Xin Chen, Sam Kwong, Ming Li
CF
2007
ACM
14 years 25 days ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
CBMS
2005
IEEE
14 years 2 months ago
A High-Throughput Bioinformatics Distributed Computing Platform
In the past number of years the demand for high performance computing has greatly increased in the area of bioinformatics. The huge increase in size of many genomic databases has ...
Thomas M. Keane, Andrew J. Page, James O. McInerne...
JSA
2006
114views more  JSA 2006»
13 years 8 months ago
Distributed computing using Java: A comparison of two server designs
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
Boris Roussev, Jie Wu