Sciweavers

4860 search results - page 223 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
COCOON
1999
Springer
14 years 3 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
BMCBI
2008
83views more  BMCBI 2008»
13 years 11 months ago
An efficient genetic algorithm for structural RNA pairwise alignment and its application to non-coding RNA discovery in yeast
Background: Aligning RNA sequences with low sequence identity has been a challenging problem since such a computation essentially needs an algorithm with high complexities for tak...
Akito Taneda
FIMI
2003
84views Data Mining» more  FIMI 2003»
14 years 4 days ago
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
Takeaki Uno, Ken Satoh
JDA
2008
85views more  JDA 2008»
13 years 10 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
INFOCOM
2012
IEEE
12 years 1 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu