The University of Southampton
University of Southampton Institutional Repository

Fast String Matching using an $n$-gram Algorithm

Kim, J.Y. and Shawe-Taylor, J. (1994) Fast String Matching using an $n$-gram Algorithm Software --- Practice and Experience, 24, (1), pp. 79-88.

Record type: Article

Full text not available from this repository.

More information

Published date: January 1994
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 259811
URI: http://eprints.soton.ac.uk/id/eprint/259811
ISSN: 0038-0644
PURE UUID: d77df688-63c0-4906-9abb-8b56480ceddf

Catalogue record

Date deposited: 23 Aug 2004
Last modified: 18 Jul 2017 09:19

Export record

Contributors

Author: J.Y. Kim
Author: J. Shawe-Taylor

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×