25 search results - page 4 / 5 » cpm 2009 |
CPM
2009
Springer
14 years 10 months ago
2009
Springer
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...
CPM
2009
Springer
15 years 29 days ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
118
click to vote
CPM
2009
Springer
14 years 7 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
CPM
2009
Springer
15 years 4 months ago
2009
Springer
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
111
click to vote
IBPRIA
2009
Springer
15 years 2 months ago
2009
Springer
Recent works in object recognition often use visual words, i.e. vector quantized local descriptors extracted from the images. In this paper we present a novel method to build such ...