|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
22 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A fully linear-time approximation algorithm for grammar-based compression |
Sakamoto, Hiroshi |
2005 |
38-41 | 2-4 |
p. 416-430 15 p. |
article |
|
| 2 | An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees |
Elemento, Olivier |
2005 |
38-41 | 2-4 |
p. 362-374 13 p. |
article |
|
| 3 | An improved algorithm for generalized comparison of minisatellites |
Behzadi, Behshad |
2005 |
38-41 | 2-4 |
p. 375-389 15 p. |
article |
|
| 4 | Author Index |
2005 |
38-41 | 2-4 |
p. 472-473 2 p. |
article |
||
| 5 | Bit-parallel approximate string matching algorithms with transposition |
Hyyrö, Heikki |
2005 |
38-41 | 2-4 |
p. 215-229 15 p. |
article |
|
| 6 | Bit-parallel ( δ , γ ) -matching and suffix automata |
Crochemore, Maxime |
2005 |
38-41 | 2-4 |
p. 198-214 17 p. |
article |
|
| 7 | Chaining algorithms for multiple genome comparison |
Abouelhoda, Mohamed Ibrahim |
2005 |
38-41 | 2-4 |
p. 321-341 21 p. |
article |
|
| 8 | Constrained tree inclusion |
Valiente, Gabriel |
2005 |
38-41 | 2-4 |
p. 431-447 17 p. |
article |
|
| 9 | Constructing suffix arrays in linear time |
Kim, Dong Kyue |
2005 |
38-41 | 2-4 |
p. 126-142 17 p. |
article |
|
| 10 | Decomposition algorithms for the tree edit distance problem |
Dulucq, Serge |
2005 |
38-41 | 2-4 |
p. 448-471 24 p. |
article |
|
| 11 | Distributed suffix trees |
Clifford, Raphaël |
2005 |
38-41 | 2-4 |
p. 176-197 22 p. |
article |
|
| 12 | Editorial board |
2005 |
38-41 | 2-4 |
p. iii-iv nvt p. |
article |
||
| 13 | Extracting approximate patterns |
Pelfrêne, Johann |
2005 |
38-41 | 2-4 |
p. 293-320 28 p. |
article |
|
| 14 | Foreword |
Baeza-Yates, R. |
2005 |
38-41 | 2-4 |
p. 125- 1 p. |
article |
|
| 15 | Hardness results for the center and median string problems under the weighted and unweighted edit distances |
Nicolas, François |
2005 |
38-41 | 2-4 |
p. 390-415 26 p. |
article |
|
| 16 | Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach |
Walter, Maria Emilia M.T. |
2005 |
38-41 | 2-4 |
p. 342-361 20 p. |
article |
|
| 17 | Indexing text with approximate q-grams |
Navarro, Gonzalo |
2005 |
38-41 | 2-4 |
p. 157-175 19 p. |
article |
|
| 18 | More efficient left-to-right matching for overlapping pattern |
Nedjah, Nadia |
2005 |
38-41 | 2-4 |
p. 230-247 18 p. |
article |
|
| 19 | On minimizing pattern splitting in multi-track string matching |
Lemström, Kjell |
2005 |
38-41 | 2-4 |
p. 248-266 19 p. |
article |
|
| 20 | Practical algorithms for transposition-invariant string-matching |
Lemström, Kjell |
2005 |
38-41 | 2-4 |
p. 267-292 26 p. |
article |
|
| 21 | Space efficient linear time construction of suffix arrays |
Ko, Pang |
2005 |
38-41 | 2-4 |
p. 143-156 14 p. |
article |
|
| 22 | Subject Index |
2005 |
38-41 | 2-4 |
p. 474-477 4 p. |
article |
22 results found