Sciweavers

3702 search results - page 264 / 741
» All Pairings Are in a Group
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
BMCBI
2010
133views more  BMCBI 2010»
15 years 6 months ago
Improving de novo sequence assembly using machine learning and comparative genomics for overlap correction
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
Lance E. Palmer, Mathäus Dejori, Randall A. B...
BMCBI
2010
183views more  BMCBI 2010»
15 years 6 months ago
Active learning for human protein-protein interaction prediction
Background: Biological processes in cells are carried out by means of protein-protein interactions. Determining whether a pair of proteins interacts by wet-lab experiments is reso...
Thahir P. Mohamed, Jaime G. Carbonell, Madhavi Gan...
BMCBI
2007
102views more  BMCBI 2007»
15 years 6 months ago
FlexOracle: predicting flexible hinges by identification of stable domains
Background: Protein motions play an essential role in catalysis and protein-ligand interactions, but are difficult to observe directly. A substantial fraction of protein motions i...
Samuel Flores, Mark Gerstein
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
15 years 6 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan