Sciweavers

2192 search results - page 33 / 439
» Algorithms for Challenging Motif Problems
Sort
View
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 8 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
DMTCS
2003
99views Mathematics» more  DMTCS 2003»
13 years 9 months ago
Combinatorial Problems Arising in SNP and Haplotype Analysis
It is widely anticipated that the study of variation in the human genome will provide a means of predicting risk of a variety of complex diseases. This paper presents a number of a...
Bjarni V. Halldórsson, Vineet Bafna, Nathan...
PROCEDIA
2010
138views more  PROCEDIA 2010»
13 years 2 months ago
Using the reconfigurable massively parallel architecture COPACOBANA 5000 for applications in bioinformatics
Currently several computational problems require high processing power to handle huge amounts of data, although underlying core algorithms appear to be rather simple. Especially i...
Lars Wienbrandt, Stefan Baumgart, Jost Bissel, Car...
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 10 months ago
Searching and mining trillions of time series subsequences under dynamic time warping
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
Thanawin Rakthanmanon, Bilson J. L. Campana, Abdul...
COMPSAC
2002
IEEE
14 years 1 months ago
Object Identification in Legacy Code as a Grouping Problem
Maintenance is undoubtedly the most effort-consuming activity in software production whereby the entropy of legacy systems (e.g., due to redundancies, poor modularity and lack of ...
Houari A. Sahraoui, Petko Valtchev, Idrissa Konkob...