Srikrishnan Divakaran

Learn More
We address the problem of sequential single machine scheduling of jobs with release times, where jobs are classified into types, and the machine must be properly configured to handle jobs of a given type. The objective is to minimize the maximum flow time (time from release until completion) of any job. We consider this problem under the assumptions of(More)
Given a pattern string P of length n and a query string T of length m, where the characters of P and T are drawn from an alphabet of size ∆, the exact string matching problem consists of finding all occurrences of P in T . For this problem, we present algorithms that in O(n∆) time preprocess P to essentially identify sparse(P ), a rarely occurring substring(More)
In this paper, we present new approximation results for the offline problem of single machine scheduling with sequenceindependent set-ups and item availability, where the jobs to be scheduled are independent (i.e., have no precedence constraints) and have a common release time. We present polynomial-time approximation algorithms for two versions of this(More)
Advances in bio-technology have made available massive amounts of functional, structural and genomic data for many biological sequences. This increased availability of heterogeneous biological data has resulted in biological applications where a multiple sequence alignment (msa) is required for aligning similar features, where a feature is described in(More)
Given a pattern string P of length n consisting of δ distinct characters and a query string T of length m, where the characters of P and T are drawn from an alphabet Σ of size ∆, the exact string matching problem consists of finding all occurrences of P in T . For this problem, we present a randomized heuristic that in O(nδ) time preprocesses P to identify(More)
For the static list update problem, given an ordered list ρ0 (an ordering of the list L = { aa, a2, ..., al }), and a sequence σ = (σ1, σ2, ..., σm) of requests for items in L, we characterize the list reorganizations in an optimal offline solution in terms of an initial permutation of the list followed by a sequence of m element transfers, where an element(More)
In generalized tree alignment problem, we are given a set S of k biologically related sequences and we are interested in a minimum cost evolutionary tree for S. In many instances of this problem partial topology of the phylogenetic tree for S is known. In such instances, we would like to make use of this knowledge to restrict the tree topologies that we(More)
  • 1