Sciweavers

1028 search results - page 77 / 206
» Character sets of strings
Sort
View
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
14 years 16 days ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 7 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
ADC
2005
Springer
124views Database» more  ADC 2005»
14 years 1 months ago
Removing XML Data Redundancies Using Functional and Equality-Generating Dependencies
We study the design issues of data-centric XML documents where (1) there are no mixed contents, i.e., each element may have some subelements and attributes, or it may have a singl...
Junhu Wang, Rodney W. Topor
FSTTCS
2003
Springer
14 years 28 days ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 2 days ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas