Sciweavers

66 search results - page 2 / 14
» A parallel algorithm for the extraction of structured motifs
Sort
View
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 7 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
RECOMB
2004
Springer
14 years 5 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
BMCBI
2007
86views more  BMCBI 2007»
13 years 5 months ago
Detecting microsatellites within genomes: significant variation among algorithms
Background: Microsatellites are short, tandemly-repeated DNA sequences which are widely distributed among genomes. Their structure, role and evolution can be analyzed based on exh...
Sébastien Leclercq, Eric Rivals, Philippe J...
HIPC
2009
Springer
13 years 3 months ago
Extracting the textual and temporal structure of supercomputing logs
Supercomputers are prone to frequent faults that adversely affect their performance, reliability and functionality. System logs collected on these systems are a valuable resource o...
Sourabh Jain, Inderpreet Singh, Abhishek Chandra, ...
ICPP
2009
IEEE
13 years 3 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...