Sciweavers

2370 search results - page 348 / 474
» A Structured Set of Higher-Order Problems
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
15 years 3 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
178
Voted
BMCBI
2007
194views more  BMCBI 2007»
15 years 3 months ago
Kernel-imbedded Gaussian processes for disease classification using microarray gene expression data
Background: Designing appropriate machine learning methods for identifying genes that have a significant discriminating power for disease outcomes has become more and more importa...
Xin Zhao, Leo Wang-Kit Cheung
137
Voted
CGF
2006
125views more  CGF 2006»
15 years 3 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
142
Voted
PVLDB
2010
129views more  PVLDB 2010»
15 years 1 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
157
Voted
ICALP
2011
Springer
14 years 7 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...