Sciweavers

16 search results - page 3 / 4
» The mutated subsequence problem and locating conserved genes
Sort
View
BMCBI
2010
134views more  BMCBI 2010»
13 years 5 months ago
BayesMotif: de novo protein sorting motif discovery from impure datasets
Background: Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regul...
Jianjun Hu, Fan Zhang
CSB
2002
IEEE
121views Bioinformatics» more  CSB 2002»
13 years 10 months ago
Fast and Sensitive Algorithm for Aligning ESTs to Human Genome
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
Jun Ogasawara, Shinichi Morishita
BMCBI
2011
12 years 9 months ago
Improving pan-genome annotation using whole genome multiple alignment
Background: Rapid annotation and comparisons of genomes from multiple isolates (pan-genomes) is becoming commonplace due to advances in sequencing technology. Genome annotations c...
Samuel V. Angiuoli, Julie C. Dunning Hotopp, Steve...
BMCBI
2005
102views more  BMCBI 2005»
13 years 5 months ago
Genome-wide identification of the regulatory targets of a transcription factor using biochemical characterization and computatio
Background: A major challenge in computational genomics is the development of methodologies that allow accurate genome-wide prediction of the regulatory targets of a transcription...
Emmitt R. Jolly, Chen-Shan Chin, Ira Herskowitz, H...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
13 years 11 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed