4.3 Article

On the complexity of approximately matching a string to a directed graph

Related references

Note: Only part of the references are listed.
Article Biochemical Research Methods

Building a Pan-Genome Reference for a Population

Ngan Nguyen et al.

JOURNAL OF COMPUTATIONAL BIOLOGY (2015)

Article Computer Science, Theory & Methods

Kernel bounds for path and cycle problems

Hans L. Bodlaender et al.

THEORETICAL COMPUTER SCIENCE (2013)

Article Computer Science, Hardware & Architecture

On problems without polynomial kernels

Hans L. Bodlaender et al.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2009)

Article Multidisciplinary Sciences

An Eulerian path approach to DNA fragment assembly

PA Pevzner et al.

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2001)

Article Computer Science, Theory & Methods

Pattern matching in hypertext

A Amir et al.

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2000)

Article Computer Science, Theory & Methods

Improved approximate pattern matching on hypertext

G Navarro

THEORETICAL COMPUTER SCIENCE (2000)