Learn More
We present a self-adjusting layout scheme for suffix trees in secondary storage that provides optimal number of disk accesses for a sequence of string or substring queries. This has been an open problem since Sleator and Tarjan presented their splaying technique to create self-adjusting binary search trees in 1985. In addition to resolving this open(More)
DNA-protein alignment algorithms can be used to discover coding sequences in a genomic sequence, if the corresponding protein derivatives are known. They can also be used to identify potential coding sequences of a newly sequenced genome, by using proteins from related species. Previously known algorithms either solve a simplified formulation, or sacrifice(More)
We developed a novel Designed Primer-based RNA-sequencing strategy (DP-seq) that uses a defined set of heptamer primers to amplify the majority of expressed transcripts from limiting amounts of mRNA, while preserving their relative abundance. Our strategy reproducibly yielded high levels of amplification from as low as 50 picograms of mRNA while offering a(More)
We present a linear time algorithm to sort all the suffixes of a string over a large alphabet of integers. The sorted order of suffixes of a string is also called suffix array, a data structure introduced by Manber and Myers that has numerous applications in computational biology. Though the suffix tree of a string can be constructed in linear time and the(More)
  • 1