Time-Space Trade-Offs for the Longest Common Substring Problem

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-38905-4_22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg