Sciweavers

1071 search results - page 181 / 215
» Programming with enumerable sets of structures
Sort
View
143
Voted
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 8 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
149
Voted
IPPS
2006
IEEE
15 years 8 months ago
Multiple sequence alignment by quantum genetic algorithm
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
L. Abdesslem, M. Soham, B. Mohamed
140
Voted
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 8 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
118
Voted
CSB
2002
IEEE
121views Bioinformatics» more  CSB 2002»
15 years 7 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
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
15 years 7 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang