Entry Baeza-Yates:1991:SS 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{Baeza-Yates:1991:SS,
  author =       "R. A. Baeza-Yates",
  title =        "Searching subsequences",
  journal =      j-THEOR-COMP-SCI,
  volume =       "78",
  number =       "2",
  pages =        "363--376",
  day =          "31",
  month =        jan,
  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 = "C4220 (Automata theory); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. de Ciencias de la Comput., Escuela de
                 Ingenieria, Chile Univ., Santiago, Chile",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; computational complexity;
                 deterministic automata; deterministic partial finite
                 automaton; directed acyclic subsequence graph; finite
                 automata; longest common subsequence problem; multiple
                 strings; search problems; transition function",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries