BibTeX record journals/ipl/OhlebuschG10

download as .bib file

@article{DBLP:journals/ipl/OhlebuschG10,
  author       = {Enno Ohlebusch and
                  Simon Gog},
  title        = {Efficient algorithms for the all-pairs suffix-prefix problem and the
                  all-pairs substring-prefix problem},
  journal      = {Inf. Process. Lett.},
  volume       = {110},
  number       = {3},
  pages        = {123--128},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ipl.2009.10.015},
  doi          = {10.1016/J.IPL.2009.10.015},
  timestamp    = {Fri, 26 May 2017 22:54:46 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/OhlebuschG10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics