Sciweavers

452 search results - page 38 / 91
» Gene finding in novel genomes
Sort
View
RECOMB
2004
Springer
14 years 8 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh
BMCBI
2008
114views more  BMCBI 2008»
13 years 8 months ago
Dinucleotide controlled null models for comparative RNA gene prediction
Background: Comparative prediction of RNA structures can be used to identify functional noncoding RNAs in genomic screens. It was shown recently by Babak et al. [BMC Bioinformatic...
Tanja Gesell, Stefan Washietl
BMCBI
2010
95views more  BMCBI 2010»
13 years 8 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...
TCBB
2008
113views more  TCBB 2008»
13 years 8 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause
BMCBI
2006
82views more  BMCBI 2006»
13 years 8 months ago
Transcriptomic response to differentiation induction
Background: Microarrays used for gene expression studies yield large amounts of data. The processing of such data typically leads to lists of differentially-regulated genes. A com...
G. W. Patton, Robert M. Stephens, I. A. Sidorov, X...