Entry Ukkonen:1992:ASM from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

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{Ukkonen:1992:ASM,
  author =       "E. Ukkonen",
  title =        "Approximate string-matching with $q$-grams and maximal
                 matches",
  journal =      j-THEOR-COMP-SCI,
  volume =       "92",
  number =       "1",
  pages =        "191--211",
  day =          "06",
  month =        jan,
  year =         "1992",
  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 = "C1250 (Pattern recognition); C4240P (Parallel
                 programming and algorithm theory); C6120 (File
                 organisation)",
  conflocation = "Paris, France; July 1990",
  conftitle =    "Combinatorial Pattern Matching School",
  corpsource =   "Dept. of Comput. Sci., Helsinki Univ., Finland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; approximate string-matching;
                 associated string-matching problem; data structures;
                 edit distance; edit distance based string-matching;
                 fast hybrid algorithms; linear time; locally best
                 approximate occurrences; lower bound; maximal common
                 substrings; maximal matches; pattern recognition;
                 q-grams; string distance functions; unit cost model",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries