Sciweavers

119 search results - page 24 / 24
» Monitoring and Debugging the Quality of Results in Approxima...
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
13 years 10 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 5 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
BMCBI
2006
122views more  BMCBI 2006»
13 years 5 months ago
PET-Tool: a software suite for comprehensive processing and managing of Paired-End diTag (PET) sequence data
Background: We recently developed the Paired End diTag (PET) strategy for efficient characterization of mammalian transcriptomes and genomes. The paired end nature of short PET se...
Kuo Ping Chiu, Chee-Hong Wong, Qiongyu Chen, Prami...
COR
2007
80views more  COR 2007»
13 years 5 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan