Yuka Tanimura

Learn More
In this study, the protein tertiary structure prediction systems on the grid are proposed for progress of the bioinformatics. The prediction is mainly performed by the protein energy minimization. However, this method has many iterated calculation of the protein energy in most cases. To use the grid as the large-scale computing environment would be valuable(More)
Given a string S of n symbols, a longest common extension query LCE(i, j) asks for the length of the longest common prefix of the ith and jth suffixes of S. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. described several data structures for answering LCE queries that(More)
The longest common extension (LCE) problem is to preprocess a given string w of length n so that the length of the longest common prefix between suffixes of w that start at any two given positions is answered quickly. In this paper, we present a data structure of O(zτ 2 + n τ) words of space which answers LCE queries in O(1) time and can be built in O(n log(More)
Given a string S of n symbols, a longest common extension query LCE(i, j) asks for the length of the longest common prefix of the ith and jth suffixes of S. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. described several data structures for answering LCE queries that(More)
  • 1