Sciweavers

5580 search results - page 1098 / 1116
» Randomized priority algorithms
Sort
View
ANOR
2008
69views more  ANOR 2008»
13 years 7 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
High quality protein sequence alignment by combining structural profile prediction and profile alignment using SABERTOOTH
Background: Protein alignments are an essential tool for many bioinformatics analyses. While sequence alignments are accurate for proteins of high sequence similarity, they become...
Florian Teichert, Jonas Minning, Ugo Bastolla, Mar...
BMCBI
2010
82views more  BMCBI 2010»
13 years 7 months ago
Predicting the network of substrate-enzyme-product triads by combining compound similarity and functional domain composition
Background: Metabolic pathway is a highly regulated network consisting of many metabolic reactions involving substrates, enzymes, and products, where substrates can be transformed...
Lei Chen, Kai-Yan Feng, Yu-Dong Cai, Kuo-Chen Chou...
BMCBI
2010
227views more  BMCBI 2010»
13 years 7 months ago
Accurate and efficient gp120 V3 loop structure based models for the determination of HIV-1 co-receptor usage
Background: HIV-1 targets human cells expressing both the CD4 receptor, which binds the viral envelope glycoprotein gp120, as well as either the CCR5 (R5) or CXCR4 (X4) co-recepto...
Majid Masso, Iosif I. Vaisman
BMCBI
2008
117views more  BMCBI 2008»
13 years 7 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...
« Prev « First page 1098 / 1116 Last » Next »