Sciweavers

6719 search results - page 1210 / 1344
» A Generalization of Automatic Sequences
Sort
View
BMCBI
2007
102views more  BMCBI 2007»
15 years 4 months ago
qPIPSA: Relating enzymatic kinetic parameters and interaction fields
Background: The simulation of metabolic networks in quantitative systems biology requires the assignment of enzymatic kinetic parameters. Experimentally determined values are ofte...
Razif R. Gabdoulline, Matthias Stein, Rebecca C. W...
EOR
2006
107views more  EOR 2006»
15 years 4 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
BMCBI
2007
180views more  BMCBI 2007»
15 years 4 months ago
Using expression arrays for copy number detection: an example from E. coli
Background: The sequencing of many genomes and tiling arrays consisting of millions of DNA segments spanning entire genomes have made high-resolution copy number analysis possible...
Dmitriy Skvortsov, Diana Abdueva, Michael E. Stitz...
BMCBI
2007
109views more  BMCBI 2007»
15 years 4 months ago
Discarding duplicate ditags in LongSAGE analysis may introduce significant error
Background: During gene expression analysis by Serial Analysis of Gene Expression (SAGE), duplicate ditags are routinely removed from the data analysis, because they are suspected...
Jeppe Emmersen, Anna M. Heidenblut, Annabeth Laurs...
JACM
2006
99views more  JACM 2006»
15 years 4 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
« Prev « First page 1210 / 1344 Last » Next »