Entry Lopresti:1997:BEM from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Lopresti:1997:BEM,
  author =       "Daniel Lopresti and Andrew Tomkins",
  title =        "Block edit models for approximate string matching",
  journal =      j-THEOR-COMP-SCI,
  volume =       "181",
  number =       "1",
  pages =        "159--179",
  day =          "15",
  month =        jul,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:21:01 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=181&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=181&issue=1&aid=2470",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4240C
                 (Computational complexity); C6130 (Data handling
                 techniques)",
  conflocation = "Valparaiso, Chile; 3-7 April 1995",
  conftitle =    "Second International Symposium on Latin American
                 Theoretical Informatics",
  corpsource =   "Matsushita Inf. Technol. Lab., Panasonic Technol.
                 Inc., Princeton, NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "block edit distance; block edit models; computational
                 complexity; molecular biology; NP-complete; pen
                 computing; polynomial-time algorithms; string
                 matching",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries