Search dblp for Publications

export results for "Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem"

 download as .bib file

@article{DBLP:journals/jda/BreslauerI13,
  author       = {Dany Breslauer and
                  Giuseppe F. Italiano},
  title        = {Near real-time suffix tree construction via the fringe marked ancestor
                  problem},
  journal      = {J. Discrete Algorithms},
  volume       = {18},
  pages        = {32--48},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2012.07.003},
  doi          = {10.1016/J.JDA.2012.07.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BreslauerI13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BreslauerI11,
  author       = {Dany Breslauer and
                  Giuseppe F. Italiano},
  editor       = {Roberto Grossi and
                  Fabrizio Sebastiani and
                  Fabrizio Silvestri},
  title        = {Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor
                  Problem},
  booktitle    = {String Processing and Information Retrieval, 18th International Symposium,
                  {SPIRE} 2011, Pisa, Italy, October 17-21, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7024},
  pages        = {156--167},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-24583-1\_16},
  doi          = {10.1007/978-3-642-24583-1\_16},
  timestamp    = {Sun, 25 Oct 2020 23:17:26 +0100},
  biburl       = {https://dblp.org/rec/conf/spire/BreslauerI11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics