Sciweavers

1083 search results - page 33 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
BMCBI
2005
115views more  BMCBI 2005»
13 years 10 months ago
MPrime: efficient large scale multiple primer and oligonucleotide design for customized gene microarrays
Background: Enhancements in sequencing technology have recently yielded assemblies of large genomes including rat, mouse, human, fruit fly, and zebrafish. The availability of larg...
Eric C. Rouchka, Abdelnaby Khalyfa, Nigel G. F. Co...
CSC
2008
13 years 11 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
14 years 2 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
AAAI
2008
14 years 21 days ago
Efficient Haplotype Inference with Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
Esra Erdem, Ferhan Türe
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 11 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian