We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
Abstract. We introduce an adaptation of run-relaxed heaps which provides efficient heap operations with respect to the number of element comparisons performed. Our data structure g...
Background: Genome wide and cross species comparisons of amino acid repeats is an intriguing problem in biology mainly due to the highly polymorphic nature and diverse functions o...
Mridul K. Kalita, Gowthaman Ramasamy, Sekhar Durai...
In this paper we present a general framework for the comparison of intervals when preference relations have to established. The use of intervals in order to take into account impr...
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
Jingjing Hu, Xiaolan Shen, Yu Shao, Chris Bystroff...