You have Guest access.
Log In
Gregory Kucherov and Esko Ukkonen
Front matter
1-11
CPM’s 20th Anniversary: A Statistical Retrospective
12-25
Quasi-distinct Parsing and Optimal Compression Methods
26-38
Generalized Substring Compression
39-40
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques
41-53
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
54-67
Linear Time Suffix Array Construction Using D-Critical Substrings
68-77
On the Value of Multiple Read/Write Streams for Data Compression
78-91
Reoptimization of the Shortest Common Superstring Problem (Extended Abstract)
92-105
LCS Approximation via Embedding into Local Non-repetitive Strings
106-115
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
116-126
Fast Searching in Packed Strings
127-141
New Complexity Bounds for Image Matching under Rotation and Scaling
142-153
Online Approximate Matching with Non-local Distances
154-167
Faster and Space-Optimal Edit Distance “1” Dictionary
168-179
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
180
Modeling and Algorithmic Challenges in Online Social Networks
181-192
Permuted Longest-Common-Prefix Array
193-206
Periodic String Comparison
207-220
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
221-235
Maximum Motif Problem in Vertex-Colored Graphs
236-248
Fast RNA Structure Alignment for Crossing Input Structures
249-262
Sparse RNA Folding: Time and Space Efficient Algorithms
263-273
Multiple Alignment of Biological Networks: A Flexible Approach
274
Graph Mining: Patterns, Generators and Tools
275-288
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
289-300
The Structure of Level-k Phylogenetic Networks
301-313
Finding All Sorting Tandem Duplication Random Loss Operations
314-325
Average-Case Analysis of Perfect Sorting by Reversals
326-338
Statistical Properties of Factor Oracles
339-352
Haplotype Inference Constrained by Plausible Haplotype Data
353-367
Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info