Category:LNCS 1075

From BibNetWiki

Lecture Notes in Computer Science, Volume 1075

Articles in category "LNCS 1075"

There are 29 articles in this category.

A A 2 2slash 3-Approximation Algorithm for the Shortest Superstring Problem A Double Combinatorial Approach to Discovering Patterns in Biological Sequences A Faster Algorithm for Approximate String Matching Alphabet Independent and Dictionary Scaled Matching Analysis of Two-Dimensional Approximate Pattern Matching Algorithms Approximate Dictionary Queries Approximate Multiple String Search Approximate Pattern Matching in Directed Graphs Approximation Algorithms for Maximum Two-Dimensional Pattern Matching

B Boyer-Moore Strategy to Efficient Approximate String Matching C Combinatorial pattern matching: 7th Annual Symposium, CPM 96, Laguna Beach, California, June 10-12, 1996: proceedings Computing Discoveries in Molecular Biology Constructing Computer Virus Phylogenies D Docking of Conformationally Flexible Proteins E Efficient Parallel Algorithms for Tree Editing Problems F Fast Sorting by Reversal Filtration with q-Samples in Approximate String Matching Finite-State Computability of Annotations of Strings and Trees G Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem

I Improved Approximation Algorithms for Tree Alignment Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms O Original Synteny P Perfect Hashing for Strings: Forrealization and Algorithms Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization R Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach S Spliced Alignment: A New Approach to Gene Recognition Suffix Trees on Words T The Asymmetric Median Tree - A New Model for Building Consensus Trees The Suffix Tree of a Tree and Minimizing Sequential Transducers