Entry Dorohonceanu:2000:AAP from dr-dobbs-2000.bib

Last update: Fri Jan 5 02:08:04 MST 2018                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{Dorohonceanu:2000:AAP,
  author =       "Bogdan Dorohonceanu and Craig Nevill-Manning",
  title =        "Algorithm Alley: {A} Practical Suffix-Tree
                 Implementation for String Searches",
  journal =      j-DDJ,
  volume =       "25",
  number =       "7",
  pages =        "133--136, 140",
  month =        jul,
  year =         "2000",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Thu Nov 9 08:25:16 MST 2000",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/dr-dobbs-2000.bib",
  URL =          "http://www.ddj.com/ftp/2000/2000_07/aa700.txt;
                 http://www.ddj.com/ftp/2000/2000_07/aa700.zip",
  abstract =     "Suffix trees are used for string searches. Our authors
                 describe how to build a generalized suffix tree data
                 structure using as few hardware resources as possible
                 while still approaching the time complexity derived in
                 theory. Additional resources include aa700.txt
                 (listings) and aa700.zip (source code).",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.ddj.com/",
}

Related entries