Sciweavers

2192 search results - page 371 / 439
» Algorithms for Challenging Motif Problems
Sort
View
JCB
2007
146views more  JCB 2007»
13 years 8 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
TSC
2008
209views more  TSC 2008»
13 years 8 months ago
Effective Web Service Composition in Diverse and Large-Scale Service Networks
Web services are considered to be a potential silver bullet for the envisioned Service Oriented Architecture, in which loosely coupled software components are published, located, a...
Seog-Chan Oh, Dongwon Lee, Soundar R. T. Kumara
JCB
1998
129views more  JCB 1998»
13 years 7 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
PPDP
2010
Springer
13 years 6 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
UIST
2010
ACM
13 years 6 months ago
Mixture model based label association techniques for web accessibility
An important aspect of making the Web accessible to blind users is ensuring that all important web page elements such as links, clickable buttons, and form fields have explicitly ...
Muhammad Asiful Islam, Yevgen Borodin, I. V. Ramak...