Entry Jiang:1995:SCS 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{Jiang:1995:SCS,
  author =       "Tao Jiang and Vadim G. Timkovsky",
  title =        "Shortest consistent superstrings computable in
                 polynomial time",
  journal =      j-THEOR-COMP-SCI,
  volume =       "143",
  number =       "1",
  pages =        "113--122",
  day =          "29",
  month =        may,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&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=1995&volume=143&issue=1&aid=1886",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci. and Syst., McMaster Univ.,
                 Hamilton, Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; computational geometry; DNA
                 sequencing; hybridization; longest common
                 nonsuperstring; negative strings; NP-hard; polynomial
                 time; shortest consistent superstrings",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries