Sciweavers

10435 search results - page 369 / 2087
» Computational Biology and Language
Sort
View
RECOMB
2007
Springer
16 years 7 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
RECOMB
2006
Springer
16 years 7 months ago
Integrated Protein Interaction Networks for 11 Microbes
We have combined four different types of functional genomic data to create high coverage protein interaction networks for 11 microbes. Our integration algorithm naturally handles s...
Balaji S. Srinivasan, Antal F. Novak, Jason Flanni...
RECOMB
2005
Springer
16 years 7 months ago
A Framework for Orthology Assignment from Gene Rearrangement Data
Abstract. Gene rearrangements have been used successfully in phylogenetic reconstruction and comparative genomics, but usually under the assumption that all genomes have the same g...
Krister M. Swenson, Nicholas D. Pattengale, Bernar...
RECOMB
2001
Springer
16 years 7 months ago
Class discovery in gene expression data
Recent studies (Alizadeh et al, [1]; Bittner et al,[5]; Golub et al, [11]) demonstrate the discovery of putative disease subtypes from gene expression data. The underlying computa...
Amir Ben-Dor, Nir Friedman, Zohar Yakhini
RECOMB
2001
Springer
16 years 7 months ago
Context-specific Bayesian clustering for gene expression data
The recent growth in genomic data and measurements of genome-wide expression patterns allows us to apply computational tools to examine gene regulation by transcription factors. I...
Yoseph Barash, Nir Friedman