Search dblp for Publications

export results for "Space Efficient Suffix Trees."

 download as .bib file

@article{DBLP:journals/tcs/PrezzaR21,
  author       = {Nicola Prezza and
                  Giovanna Rosone},
  title        = {Space-efficient construction of compressed suffix trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {852},
  pages        = {138--156},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2020.11.024},
  doi          = {10.1016/J.TCS.2020.11.024},
  timestamp    = {Fri, 18 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PrezzaR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1908-04686,
  author       = {Nicola Prezza and
                  Giovanna Rosone},
  title        = {Space-Efficient Construction of Compressed Suffix Trees},
  journal      = {CoRR},
  volume       = {abs/1908.04686},
  year         = {2019},
  url          = {http://arxiv.org/abs/1908.04686},
  eprinttype    = {arXiv},
  eprint       = {1908.04686},
  timestamp    = {Mon, 19 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1908-04686.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FischerIKS18,
  author       = {Johannes Fischer and
                  Tomohiro I and
                  Dominik K{\"{o}}ppl and
                  Kunihiko Sadakane},
  title        = {Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees},
  journal      = {Algorithmica},
  volume       = {80},
  number       = {7},
  pages        = {2048--2081},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00453-017-0333-1},
  doi          = {10.1007/S00453-017-0333-1},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FischerIKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/VitaleMS15,
  author       = {Luciana Vitale and
                  Alvaro Mart{\'{\i}}n and
                  Gadiel Seroussi},
  title        = {Space-efficient representation of truncated suffix trees, with applications
                  to Markov order estimation},
  journal      = {Theor. Comput. Sci.},
  volume       = {595},
  pages        = {34--45},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.06.013},
  doi          = {10.1016/J.TCS.2015.06.013},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/VitaleMS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isit/VitaleMS13,
  author       = {Luciana Vitale and
                  Alvaro Mart{\'{\i}}n and
                  Gadiel Seroussi},
  title        = {Space-efficient representation of truncated suffix trees, with applications
                  to Markov order estimation},
  booktitle    = {Proceedings of the 2013 {IEEE} International Symposium on Information
                  Theory, Istanbul, Turkey, July 7-12, 2013},
  pages        = {1924--1928},
  publisher    = {{IEEE}},
  year         = {2013},
  url          = {https://doi.org/10.1109/ISIT.2013.6620561},
  doi          = {10.1109/ISIT.2013.6620561},
  timestamp    = {Wed, 16 Oct 2019 14:14:48 +0200},
  biburl       = {https://dblp.org/rec/conf/isit/VitaleMS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/acsc/MonostoriZS02,
  author       = {Kriszti{\'{a}}n Monostori and
                  Arkady B. Zaslavsky and
                  Heinz W. Schmidt},
  editor       = {Michael J. Oudshoorn},
  title        = {Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees},
  booktitle    = {Computer Science 2002, Twenty-Fifth Australasian Computer Science
                  Conference (ACSC2002), Monash University, Melbourne, Victoria, Australia,
                  January/February 2002},
  series       = {{CRPIT}},
  volume       = {4},
  pages        = {157--165},
  publisher    = {Australian Computer Society},
  year         = {2002},
  url          = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV4Monostori.html},
  timestamp    = {Wed, 10 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/acsc/MonostoriZS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/MunroRR01,
  author       = {J. Ian Munro and
                  Venkatesh Raman and
                  S. Srinivasa Rao},
  title        = {Space Efficient Suffix Trees},
  journal      = {J. Algorithms},
  volume       = {39},
  number       = {2},
  pages        = {205--222},
  year         = {2001},
  url          = {https://doi.org/10.1006/jagm.2000.1151},
  doi          = {10.1006/JAGM.2000.1151},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MunroRR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/MunroRR98,
  author       = {J. Ian Munro and
                  Venkatesh Raman and
                  S. Srinivasa Rao},
  editor       = {Vikraman Arvind and
                  Ramaswamy Ramanujam},
  title        = {Space Efficient Suffix Trees},
  booktitle    = {Foundations of Software Technology and Theoretical Computer Science,
                  18th Conference, Chennai, India, December 17-19, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1530},
  pages        = {186--196},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/978-3-540-49382-2\_17},
  doi          = {10.1007/978-3-540-49382-2\_17},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/MunroRR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/KosarajuD96,
  author       = {S. Rao Kosaraju and
                  Arthur L. Delcher},
  editor       = {Gary L. Miller},
  title        = {Large-Scale Assembly of {DNA} Strings and Space-Efficient Construction
                  of Suffix Trees (Correction)},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
                  of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
  pages        = {659},
  publisher    = {{ACM}},
  year         = {1996},
  url          = {https://doi.org/10.1145/237814.250975},
  doi          = {10.1145/237814.250975},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KosarajuD96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/KosarajuD95,
  author       = {S. Rao Kosaraju and
                  Arthur L. Delcher},
  editor       = {Frank Thomson Leighton and
                  Allan Borodin},
  title        = {Large-scale assembly of {DNA} strings and space-efficient construction
                  of suffix trees},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
                  of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  pages        = {169--177},
  publisher    = {{ACM}},
  year         = {1995},
  url          = {https://doi.org/10.1145/225058.225108},
  doi          = {10.1145/225058.225108},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KosarajuD95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.