Entry Tarhio:1988:GAA from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Tarhio:1988:GAA,
  author =       "Jorma Tarhio and Esko Ukkonen",
  title =        "A greedy approximation algorithm for constructing
                 shortest common superstrings",
  journal =      j-THEOR-COMP-SCI,
  volume =       "57",
  number =       "1",
  pages =        "131--145",
  month =        apr,
  year =         "1988",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Helsinki",
  affiliationaddress = "Helsinki, Finl",
  classification = "723; 921; B0290F (Interpolation and function
                 approximation); B6140 (Signal processing and
                 detection); C1260 (Information theory)C4130
                 (Interpolation and function approximation)",
  conference =   "International Symposium on Mathematical Foundations of
                 Computer Science, MFCS '86",
  conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
  conftitle =    "International Symposium on Mathematical Foundations of
                 Computer Science",
  corpsource =   "Dept. of Comput. Sci., Helsinki Univ., Finland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "Algorithms; approximation theory; Computer
                 Programming; data compression; Greedy Approximation
                 Algorithm; greedy approximation algorithm; greedy
                 heuristics; Hamiltonian paths; Knuth-Morris-Pratt
                 string-matching procedure; Longest Hamiltonian Paths;
                 Mathematical Techniques --- Graph Theory; Optimization;
                 Shortest Common Superstrings; shortest common
                 superstrings; String Compression; String-Matching;
                 Weighted Graphs; weighted graphs",
  meetingaddress = "Bratislava, Czech",
  meetingdate =  "Aug 25--29 1986",
  meetingdate2 = "08/25--29/86",
  pubcountry =   "Netherlands A07",
  treatment =    "T Theoretical or Mathematical",
}

Related entries