Sciweavers

IJFCS
2008
73views more  IJFCS 2008»
13 years 4 months ago
State Complexity of the Subword Closure Operation with Applications to DNA Coding
Cezar Câmpeanu, Stavros Konstantinidis
IJFCS
2006
108views more  IJFCS 2006»
13 years 4 months ago
Convex Drawings of Plane Graphs of Minimum Outer Apices
Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
IJFCS
2006
108views more  IJFCS 2006»
13 years 4 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
IJFCS
2006
70views more  IJFCS 2006»
13 years 4 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
IJFCS
2006
70views more  IJFCS 2006»
13 years 4 months ago
Convex Grid Drawings of Four-connected Plane Graphs
Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
IJFCS
2006
58views more  IJFCS 2006»
13 years 4 months ago
Planar Crossing Numbers of Graphs Embeddable in Another Surface
Károly J. Börözky, János P...
IJFCS
2006
91views more  IJFCS 2006»
13 years 4 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
IJFCS
2006
83views more  IJFCS 2006»
13 years 4 months ago
A Simple Alphabet-independent Fm-index
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarsk...
IJFCS
2006
87views more  IJFCS 2006»
13 years 4 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
IJFCS
2006
85views more  IJFCS 2006»
13 years 4 months ago
On Embedding a Graph on Two Sets of Points
Emilio Di Giacomo, Giuseppe Liotta, Francesco Trot...