Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=807

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

A space efficient algorithm for finding the best non-overlapping alignment score
Gary Benson
Lecture Notes in Computer Science 807, 1994, pp. 1-14
The parameterized complexity of sequence alignment and consensus
Hans Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
Lecture Notes in Computer Science 807, 1994, pp. 15-30
Computing all suboptimal alignments in linear space
Kun-Mao Chao
Lecture Notes in Computer Science 807, 1994, pp. 31-42
Approximation algorithms for multiple sequence alignment
Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner
Lecture Notes in Computer Science 807, 1994, pp. 43-53
A context dependent method for comparing sequences
Xiaoqiu Huang
Lecture Notes in Computer Science 807, 1994, pp. 54-63
Fast identification of approximately matching substrings
Archie L. Cobbs
Lecture Notes in Computer Science 807, 1994, pp. 64-74
Alignment of trees - An alternative to tree edit
Tao Jiang, Lusheng Wang, Kaizhong Zhang
Lecture Notes in Computer Science 807, 1994, pp. 75-86
Parametric recomputing in alignment graphs
Xiaoqiu Huang, Pavel A. Pevzner, Webb Miller
Lecture Notes in Computer Science 807, 1994, pp. 87-101
A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms
Tomasz Łuczak, Wojciech Szpankowski
Lecture Notes in Computer Science 807, 1994, pp. 102-112
A text compression scheme that allows fast searching directly in the compressed file
Udi Manber
Lecture Notes in Computer Science 807, 1994, pp. 113-124
An alphabet-independent optimal parallel search for three dimensional pattern
Marek Karpinski, Wojciech Rytter
Lecture Notes in Computer Science 807, 1994, pp. 125-135
Unit route upper bound for string-matching on hypercube
L. Lestrée
Lecture Notes in Computer Science 807, 1994, pp. 136-145
Computation of squares in a string
S. Rao Kosaraju
Lecture Notes in Computer Science 807, 1994, pp. 146-150
Minimization of sequential transducers
Mehryar Mohri
Lecture Notes in Computer Science 807, 1994, pp. 151-163
Shortest common superstrings for strings of random letters
Kenneth S. Alexander
Lecture Notes in Computer Science 807, 1994, pp. 164-172
Maximal common subsequences and minimal common supersequences
Robert W. Irving, Campbell B. Fraser
Lecture Notes in Computer Science 807, 1994, pp. 173-183
Dictionary-matching on unbounded alphabets: Uniform length dictionaries
Dany Breslauer
Lecture Notes in Computer Science 807, 1994, pp. 184-197
Proximity matching using fixed-queries trees
Ricardo Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu
Lecture Notes in Computer Science 807, 1994, pp. 198-212
Query primitives for tree-structured data
Pekka Kilpeläinen, Heikki Mannila
Lecture Notes in Computer Science 807, 1994, pp. 213-225
Multiple matching of parameterized patterns
Ramana M. Idury, Alejandro A. Schäffer
Lecture Notes in Computer Science 807, 1994, pp. 226-239
Approximate string matching with don't care characters
Tatsuya Akutsu
Lecture Notes in Computer Science 807, 1994, pp. 240-249
Matching with matrix norm minimization
Shouwen Tang, Kaizhong Zhang, Xiaolin Wu
Lecture Notes in Computer Science 807, 1994, pp. 250-258
Approximate string matching and local similarity
William I. Chang, Thomas G. Marr
Lecture Notes in Computer Science 807, 1994, pp. 259-273
Polynomial-time algorithms for computing characteristic strings
Minoru Ito, Kuniyasu Shimizu, Michio Nakanishi, Akihiro Hashimoto
Lecture Notes in Computer Science 807, 1994, pp. 274-288
Recent methods for RNA modeling using stochastic context-free grammars
Yasubumi Sakakibara, Michael Brown, Richard Hughey, I. Saira Mian, Kimmen Sjölander, Rebecca C. Underwood, David Haussler
Lecture Notes in Computer Science 807, 1994, pp. 289-306

Seiten 1 2 >