Sciweavers

145 search results - page 13 / 29
» On finding approximate optimal paths in weighted regions
Sort
View
CSB
2003
IEEE
108views Bioinformatics» more  CSB 2003»
14 years 24 days ago
A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide mo...
Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga
EVOW
2010
Springer
13 years 6 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
13 years 11 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
13 years 2 months ago
Aggregation-based model reduction of a Hidden Markov Model
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Kun Deng, Prashant G. Mehta, Sean P. Meyn