Sciweavers

ESA
2003
Springer
95views Algorithms» more  ESA 2003»
13 years 9 months ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur
PPPJ
2003
ACM
13 years 9 months ago
Rethinking Java strings
The Java string classes, String and StringBuffer, lie at the extremes of a spectrum (immutable, reference-based and mutable, content-based). Motivated by data-intensive text appli...
Paolo Boldi, Sebastiano Vigna
LATIN
2004
Springer
13 years 10 months ago
Combinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Alantha Newman, Matthias Ruhl
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
13 years 10 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
MFCS
2005
Springer
13 years 10 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
13 years 10 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
13 years 10 months ago
Testing Periodicity
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
Oded Lachish, Ilan Newman
CLEANDB
2006
ACM
145views Database» more  CLEANDB 2006»
13 years 10 months ago
Cleansing Databases of Misspelled Proper Nouns
The paper presents a data cleansing technique for string databases. We propose and evaluate an algorithm that identifies a group of strings that consists of (multiple) occurrence...
Arturas Mazeika, Michael H. Böhlen
APLAS
2006
ACM
13 years 10 months ago
A Practical String Analyzer by the Widening Approach
The static determination of approximated values of string expressions has many potential applications. For instance, approximated string values may be used to check the validity an...
Tae-Hyoung Choi, Oukseh Lee, Hyunha Kim, Kyung-Goo...