More efficient left-to-right matching for overlapping pattern (English)
- New search for: Nedjah, N.
- New search for: de Macedo Mourelle, L.
- New search for: Nedjah, N.
- New search for: de Macedo Mourelle, L.
In:
JOURNAL OF DISCRETE ALGORITHMS -ELSEVIER-
;
3
, 2-4
;
230-247
;
2005
-
ISSN:
- Article (Journal) / Print
-
Title:More efficient left-to-right matching for overlapping pattern
-
Contributors:Nedjah, N. ( author ) / de Macedo Mourelle, L. ( author )
-
Published in:JOURNAL OF DISCRETE ALGORITHMS -ELSEVIER- ; 3, 2-4 ; 230-247
-
Publisher:
- New search for: Elsevier
-
Publication date:2005-01-01
-
Size:18 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 518.1
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 518.1 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 3, Issue 2-4
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 125
-
ForewordBaeza-Yates, R. / Crochemore, M. et al. | 2004
- 126
-
Constructing suffix arrays in linear timeKim, Dong Kyue / Sim, Jeong Seop / Park, Heejin / Park, Kunsoo et al. | 2004
- 143
-
Space efficient linear time construction of suffix arraysKo, Pang / Aluru, Srinivas et al. | 2004
- 157
-
Indexing text with approximate q-gramsNavarro, Gonzalo / Sutinen, Erkki / Tarhio, Jorma et al. | 2004
- 176
-
Distributed suffix treesClifford, Raphaël et al. | 2004
- 198
-
Bit-parallel -matching and suffix automataCrochemore, Maxime / Iliopoulos, Costas S. / Navarro, Gonzalo / Pinzon, Yoan J. / Salinger, Alejandro et al. | 2004
- 198
-
Bit-parallel Formula Not Shown -matching and suffix automataCrochemore, M. / Iliopoulos, C. S. / Navarro, G. / Pinzon, Y. J. / Salinger, A. et al. | 2005
- 215
-
Bit-parallel approximate string matching algorithms with transpositionHyyrö, Heikki et al. | 2004
- 230
-
More efficient left-to-right matching for overlapping patternNedjah, Nadia / de Macedo Mourelle, Luiza et al. | 2004
- 248
-
On minimizing pattern splitting in multi-track string matchingLemström, Kjell / Mäkinen, Veli et al. | 2004
- 267
-
Practical algorithms for transposition-invariant string-matchingLemström, Kjell / Navarro, Gonzalo / Pinzon, Yoan et al. | 2004
- 293
-
Extracting approximate patternsPelfrêne, Johann / Abdeddaïm, Saïd / Alexandre, Joël et al. | 2004
- 321
-
Chaining algorithms for multiple genome comparisonAbouelhoda, Mohamed Ibrahim / Ohlebusch, Enno et al. | 2004
- 342
-
Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approachWalter, Maria Emilia M.T. / Sobrinho, Mauro C. / Oliveira, Eugenia T.G. / Soares, Lorena S. / Oliveira, Adilton G. / Martins, Thelmo E.S. / Fonseca, Tiago M. et al. | 2004
- 362
-
An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication treesElemento, Olivier / Gascuel, Olivier et al. | 2004
- 375
-
An improved algorithm for generalized comparison of minisatellitesBehzadi, Behshad / Steyaert, Jean-Marc et al. | 2004
- 390
-
Hardness results for the center and median string problems under the weighted and unweighted edit distancesNicolas, François / Rivals, Eric et al. | 2004
- 416
-
A fully linear-time approximation algorithm for grammar-based compressionSakamoto, Hiroshi et al. | 2004
- 431
-
Constrained tree inclusionValiente, Gabriel et al. | 2004
- 448
-
Decomposition algorithms for the tree edit distance problemDulucq, Serge / Touzet, Hélène et al. | 2004
- 472
-
Author Index| 2005
- 474
-
Subject Index| 2005
- iii
-
Editorial board| 2005