Sciweavers

216 search results - page 5 / 44
» Fast Optimal Algorithms for Computing All the Repeats in a S...
Sort
View
ACSC
2003
IEEE
15 years 7 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
STRINGOLOGY
2004
15 years 4 months ago
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
Frantisek Franek, William F. Smyth
IPPS
2003
IEEE
15 years 8 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
ALMOB
2008
131views more  ALMOB 2008»
15 years 3 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
CEC
2007
IEEE
15 years 9 months ago
A fractal representation for real optimization
— The chaos game, in which a moving point is repeatedly averaged toward randomly selected vertices of a triangle, is one method of generating the fractal called the Sierpinski tr...
Daniel A. Ashlock, Justin Schonfeld