Sciweavers

844 search results - page 128 / 169
» Further results on concordance relations
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
AI
2008
Springer
14 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
BMCBI
2010
175views more  BMCBI 2010»
14 years 9 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng
BMCBI
2010
115views more  BMCBI 2010»
14 years 9 months ago
Integration of multiple data sources to prioritize candidate genes using discounted rating system
Background: Identifying disease gene from a list of candidate genes is an important task in bioinformatics. The main strategy is to prioritize candidate genes based on their simil...
Yongjin Li, Jagdish Chandra Patra
89
Voted
BMCBI
2007
185views more  BMCBI 2007»
14 years 9 months ago
GEDI: a user-friendly toolbox for analysis of large-scale gene expression data
Background: Several mathematical and statistical methods have been proposed in the last few years to analyze microarray data. Most of those methods involve complicated formulas, a...
André Fujita, João Ricardo Sato, Car...