The subtree max gap problem with application to parallel string covering

Berkman, Omer; Iliopoulos, Costas S.; Park, Kunsoo

by Omer Berkman, Costas S. Iliopoulos, Kunsoo Park

Abstract:

Reference:

The subtree max gap problem with application to parallel string covering (Omer Berkman, Costas S. Iliopoulos, Kunsoo Park), In Information and Computation, volume 123, 1995. ()

Bibtex Entry:

@string{ic="Information and Computation"}
@ARTICLE{BIP95SubtreeMaxGap,
  AUTHOR =       "Omer Berkman and Costas S. Iliopoulos and Kunsoo Park",
  TITLE =        "The subtree max gap problem with application to parallel string covering",
  JOURNAL =      IC,
  YEAR =         "1995",
  volume =       "123",
  number =       "1",
  pages =        "127--137",
  month =        "",
  note =         "",
  abstract =     "",
  keywords =     "",
  source =       ""
}