Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=937

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

Computing similarity between Rna strings
Vineet Bafna, S. Muthukrishnan, R. Ravi
Lecture Notes in Computer Science 937, 1995, pp. 1-16
Of chicken teeth and mouse eyes, or generalized character compatibility
Craig Benham, Sampath Kannan, Tandy Warnow
Lecture Notes in Computer Science 937, 1995, pp. 17-26
Efficient string matching on coded texts
Dany Breslauer, Leszek Ga̧sieniec
Lecture Notes in Computer Science 937, 1995, pp. 27-40
Fast approximate matching using suffix trees
Archie L. Cobbs
Lecture Notes in Computer Science 937, 1995, pp. 41-54
Common subsequences and supersequences and their expected length
Vlado Danc̑ík
Lecture Notes in Computer Science 937, 1995, pp. 55-63
Pattern matching in directed graphs
Jianghai Fu
Lecture Notes in Computer Science 937, 1995, pp. 64-77
Constant-space string matching with smaller number of comparisons: Sequential sampling
Leszek Ga̧sieniec, Wojciech Plandowski, Wojciech Rytter
Lecture Notes in Computer Science 937, 1995, pp. 78-89
Multi-dimensional pattern matching with dimensional wildcards
Raffaele Giancarlo, Roberto Grossi
Lecture Notes in Computer Science 937, 1995, pp. 90-101
Minimizing phylogenetic number to find good evolutionary trees
Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow
Lecture Notes in Computer Science 937, 1995, pp. 102-127
Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice
Sandeep K. Gupta, John D. Kececioglu, Alejandro A. Schäffer
Lecture Notes in Computer Science 937, 1995, pp. 128-143
An efficient algorithm for developing topologically valid matchings
Liz Hanks, Ron K. Cytron, Will Gillett
Lecture Notes in Computer Science 937, 1995, pp. 144-161
Polynomial-time algorithm for computing translocation distance between genomes
Sridhar Hannenhalli
Lecture Notes in Computer Science 937, 1995, pp. 162-176
On the complexity of comparing evolutionary trees
Jotun Hein, Tao Jiang, Lusheng Wang, Kaizhong Zhang
Lecture Notes in Computer Science 937, 1995, pp. 177-190
Suffix cactus: A cross between suffix tree and suffix array
Juha Kärkkäinen
Lecture Notes in Computer Science 937, 1995, pp. 191-204
Pattern-matching for strings with short descriptions
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
Lecture Notes in Computer Science 937, 1995, pp. 205-214
Pairwise alignment with scoring on tuples
Lukas Knecht
Lecture Notes in Computer Science 937, 1995, pp. 215-229
Matching a set of strings with variable length don't cares
Gregory Kucherov, Michaël Rusinowitch
Lecture Notes in Computer Science 937, 1995, pp. 230-247
Three-dimensional pattern matching in protein structure analysis
Arthur M. Lesk
Lecture Notes in Computer Science 937, 1995, pp. 248-260
Genome analysis: Pattern search in biological macromolecules
H.W. Mewes, K. Heumann
Lecture Notes in Computer Science 937, 1995, pp. 261-285
Matching patterns of an automaton
Mehryar Mohri
Lecture Notes in Computer Science 937, 1995, pp. 286-297
New results and open problems related to non-standard stringology
S. Muthukrishnan
Lecture Notes in Computer Science 937, 1995, pp. 298-317
String matching in hypertext
Kunsoo Park, Dong Kyue Kim
Lecture Notes in Computer Science 937, 1995, pp. 318-329
Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
R. Ravi, John D. Kececioglu
Lecture Notes in Computer Science 937, 1995, pp. 330-339
A new flexible algorithm for the longest common subsequence problem
Claus Rick
Lecture Notes in Computer Science 937, 1995, pp. 340-351
Smaller representations for finite-state transducers and finite-state automata
Emmanuel Roche
Lecture Notes in Computer Science 937, 1995, pp. 352-365

Seiten 1 2 >