Sciweavers

2089 search results - page 7 / 418
» A New Problem in String Searching
Sort
View
111
Voted
STACS
1992
Springer
15 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
ALMOB
2006
97views more  ALMOB 2006»
14 years 9 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
INFOCOM
1999
IEEE
15 years 1 months ago
New Dynamic SPT Algorithm Based on a Ball-and-String Model
A key functionality in today's widely used interior gateway routing protocols such as OSPF and IS
Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng
IPPS
2003
IEEE
15 years 2 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
GBRPR
2007
Springer
15 years 1 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion