Sciweavers

3172 search results - page 104 / 635
» New developments of the Z-EDM algorithm
Sort
View
BMCBI
2005
125views more  BMCBI 2005»
15 years 3 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...
CPAIOR
2005
Springer
15 years 9 months ago
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
Thorsten Gellermann, Meinolf Sellmann, Robert Wrig...
144
Voted
FOCS
2005
IEEE
15 years 9 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
BMCBI
2010
125views more  BMCBI 2010»
15 years 4 months ago
In-silico prediction of blood-secretory human proteins using a ranking algorithm
Background: Computational identification of blood-secretory proteins, especially proteins with differentially expressed genes in diseased tissues, can provide highly useful inform...
Qi Liu, Juan Cui, Qiang Yang, Ying Xu
99
Voted
TSP
2008
89views more  TSP 2008»
15 years 3 months ago
Noncooperative Eigencoding for MIMO Ad hoc Networks
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
Duong A. Hoang, Ronald A. Iltis