The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms.
Thus, the general methodology in designing the schemes is as follows: first, give a space efficient algorithm that uses some additional memory, then show how to encode the additional memory implicitly.
Such an observation was exploited by Ukkonen [ 27] in order to obtain a space efficient algorithm for the computation of the edit distance between two strings.
Since Deep-Shallow is not useful for building LCP tables as by-product of suffix sorting (as is the case with simple multikey quicksort), we use the space-efficient, linear-time algorithm of Manzini (2004) to construct LCP tables from suffix arrays.
In DIALIGN, this is done by a space-efficient fragment-chaining algorithms [ 10, 11].
In addition, backtracking algorithms are used to search for motifs (i.e., identifying meaningful patterns in genetic sequences), greedy algorithms to detect genome rearrangements and to sort by reversals, divide-and-conquer algorithms to perform space-efficient sequence alignments, and graph algorithms for DNA assembly.
Using space-efficient encoding of differences and clever algorithms for finding long stretches of DNA without differences, the best current referential compression algorithm we are aware of reports a compression rates of up to 500 1 for human genomes [ 14].
To speed up the online search algorithm, we devise a space-efficient index structure, namely KEP-Index, to support efficient community search.
The nearest neighbor information required for Jarvis Patrick clustering can also be obtained very efficiently in Euclidean space by using an efficient algorithm for the all-nearest-neighbors problem (Vaidya, 1989).
The two-space algorithm is a particularly efficient algorithm for polymer simulation that is easy to implement and generalize on both conventional serial hardward and Cellular Automaton (CA) Machines.
There are two critical issues in solving this problem, i.e., to narrow the searching space and to develop an efficient algorithm that can find a global solution within an acceptable period of time.
