Algorithms on strings, trees, and sequences

1997 · 1,735 citations · 1 from inside this corpus

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

1 of 1 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

What cites it, inside the corpus

Paper	Year	Cited
A guided tour to approximate string matching	2001	2,586

Links

OpenAlex record

Topics

Algorithms and Data Compression	Computer Science
Natural Language Processing Techniques	Computer Science
Web Data Mining and Analysis	Computer Science

Is this record sound?

partial

One field of this record is missing or disagrees with another. What is shown below is what the source publishes.

supports1 author record(s) attached.
weakensNo references are recorded despite 1,735 citations. A paper this heavily cited did not cite nothing, so the record is incomplete.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:53+00:00.

sha256 db1645b78a57e29a…