Sciweavers

4415 search results - page 235 / 883
» How to Pair with a Human
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
110views more  BMCBI 2010»
15 years 6 months ago
Missing value imputation for epistatic MAPs
Background: Epistatic miniarray profiling (E-MAPs) is a high-throughput approach capable of quantifying aggravating or alleviating genetic interactions between gene pairs. The dat...
Colm Ryan, Derek Greene, Gerard Cagney, Padraig Cu...
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
125views more  BMCBI 2010»
15 years 6 months ago
Large-scale prediction of protein-protein interactions from structures
Background: The prediction of protein-protein interactions is an important step toward the elucidation of protein functions and the understanding of the molecular mechanisms insid...
Martial Hue, Michael Riffle, Jean-Philippe Vert, W...
BMCBI
2007
151views more  BMCBI 2007»
15 years 6 months ago
A statistical method to incorporate biological knowledge for generating testable novel gene regulatory interactions from microar
Background: The incorporation of prior biological knowledge in the analysis of microarray data has become important in the reconstruction of transcription regulatory networks in a...
Peter Larsen, Eyad Almasri, Guanrao Chen, Yang Dai