Sciweavers

941 search results - page 144 / 189
» Efficient Testing of Large Graphs
Sort
View
BMCBI
2006
116views more  BMCBI 2006»
14 years 9 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
BMCBI
2006
123views more  BMCBI 2006»
14 years 9 months ago
Computational models with thermodynamic and composition features improve siRNA design
Background: Small interfering RNAs (siRNAs) have become an important tool in cell and molecular biology. Reliable design of siRNA molecules is essential for the needs of large fun...
Svetlana A. Shabalina, Alexey N. Spiridonov, Aleks...
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
15 years 4 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
ICCV
2009
IEEE
16 years 2 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
CVPR
2006
IEEE
15 years 11 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...