Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Amir:1991:FPS,
author = "A. Amir and G. M. Landau",
title = "Fast parallel and serial multidimensional approximate
array matching",
journal = j-THEOR-COMP-SCI,
volume = "81",
number = "1",
pages = "97--115",
day = "22",
month = apr,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternate algorithm; computational complexity;
d-dimensional array; multidimensional approximate array
matching; parallel algorithm; parallel algorithms;
serial algorithm; superfluous pattern character;
superfluous text character",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}