Sciweavers

COCOON
2004
Springer
13 years 9 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
COCOON
2004
Springer
13 years 9 months ago
Regular Expressions for Languages over Infinite Alphabets
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
Michael Kaminski, Tony Tan
COCOON
2010
Springer
13 years 9 months ago
The Curse of Connectivity: t-Total Vertex (Edge) Cover
Henning Fernau, Fedor V. Fomin, Geevarghese Philip...
CPM
2009
Springer
128views Combinatorics» more  CPM 2009»
13 years 9 months ago
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan ...
CPM
2009
Springer
90views Combinatorics» more  CPM 2009»
13 years 9 months ago
Sparse RNA Folding: Time and Space Efficient Algorithms
Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-...
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
13 years 9 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq
COCOON
2009
Springer
13 years 9 months ago
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
Multiple reaction monitoring (MRM) is a mass spectrometric method to quantify a specified set of proteins. In this paper, we identify a problem at the core of MRM peptide quantific...
Rastislav Srámek, Bernd Fischer, Elias Vica...
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
13 years 9 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
CPM
2007
Springer
100views Combinatorics» more  CPM 2007»
13 years 9 months ago
Suffix Arrays on Words
Paolo Ferragina, Johannes Fischer
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
13 years 9 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...