Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1264

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

An improved pattern matching algorithm for strings in terms of straight-line programs
Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda
Lecture Notes in Computer Science 1264, 1997, pp. 1-11
Episode matching
Gautam Das, Rudolf Fleischer, Leszek Ga̧sieniec, Dimitris Gunopulos, Juha Kärkkäinen
Lecture Notes in Computer Science 1264, 1997, pp. 12-27
Efficient algorithms for approximate string matching with swaps
Jee-Soo Lee, Dong Kyue Kim, Kunsoo Park, Yookun Cho
Lecture Notes in Computer Science 1264, 1997, pp. 28-39
On the complexity of pattern matching for highly compressed two-dimensional texts
Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
Lecture Notes in Computer Science 1264, 1997, pp. 40-51
Estimating the probability of approximate matches
Stefan Kurtz, Gene Myers
Lecture Notes in Computer Science 1264, 1997, pp. 52-64
Space- and time-efficient decoding with canonical Huffman trees
Shmuel T. Klein
Lecture Notes in Computer Science 1264, 1997, pp. 65-75
On weak circular squares in binary words
Aviezri Fraenkel, Jamie Simpson, Mike Paterson
Lecture Notes in Computer Science 1264, 1997, pp. 76-82
An easy case of sorting by reversals
Nicholas Tran
Lecture Notes in Computer Science 1264, 1997, pp. 83-89
External inverse pattern matching
Leszek Ga̧sieniec, Piotr Indyk, Piotr Krysta
Lecture Notes in Computer Science 1264, 1997, pp. 90-101
Distributed generation of suffix arrays
Gonzalo Navarro, João Paulo Kitajima, Berthier A. Ribeiro-Neto, Nivio Ziviani
Lecture Notes in Computer Science 1264, 1997, pp. 102-115
Direct construction of compact directed acyclic word graphs
Maxime Crochemore, Renaud Vérin
Lecture Notes in Computer Science 1264, 1997, pp. 116-129
Approximation algorithms for the fixed-topology phylogenetic number problem
Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
Lecture Notes in Computer Science 1264, 1997, pp. 130-149
A new algorithm for the ordered tree inclusion problem
Thorsten Richter
Lecture Notes in Computer Science 1264, 1997, pp. 150-166
On incremental computation of transitive closure and greedy alignment
Saïd Abdeddaïm
Lecture Notes in Computer Science 1264, 1997, pp. 167-179
Aligning coding DNA in the presence of frame-shift errors
Lars Arvestad
Lecture Notes in Computer Science 1264, 1997, pp. 180-190
A filter method for the weighted local similarity search problem
Enno Ohlebusch
Lecture Notes in Computer Science 1264, 1997, pp. 191-205
Trie-based data structures for sequence assembly
Ting Chen, Steven S. Skiena
Lecture Notes in Computer Science 1264, 1997, pp. 206-223
Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices
Marie-France Sagot, Alain Viari
Lecture Notes in Computer Science 1264, 1997, pp. 224-246
Banishing bias from consensus sequences
Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi
Lecture Notes in Computer Science 1264, 1997, pp. 247-261
On the Nadeau-Taylor theory of conserved chromosome segments
David Sankoff, Marie-Noelle Parent, Isabelle Marchand, Vincent Ferretti
Lecture Notes in Computer Science 1264, 1997, pp. 262-274
Iterative versus simultaneous multiple sequence alignment
Andreas Dress
Lecture Notes in Computer Science 1264, 1997, pp. 275-275
Modern comparative lexicostatistics
Joseph B. Kruskal
Lecture Notes in Computer Science 1264, 1997, pp. 276-276