Sciweavers

95 search results - page 8 / 19
» Finding one tight cycle
Sort
View
BMCBI
2008
161views more  BMCBI 2008»
13 years 10 months ago
Inferring gene expression dynamics via functional regression analysis
Background: Temporal gene expression profiles characterize the time-dynamics of expression of specific genes and are increasingly collected in current gene expression experiments....
Hans-Georg Müller, Jeng-Min Chiou, Xiaoyan Le...
BMCBI
2006
141views more  BMCBI 2006»
13 years 10 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
ALMOB
2006
97views more  ALMOB 2006»
13 years 10 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
SIAMJO
2008
144views more  SIAMJO 2008»
13 years 9 months ago
Embedded in the Shadow of the Separator
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Frank Göring, Christoph Helmberg, Markus Wapp...
JDA
2008
122views more  JDA 2008»
13 years 9 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan