Search dblp for Publications

export results for "toc:db/journals/jda/jda25.bht:"

 download as .bib file

@article{DBLP:journals/jda/AkutsuTFT14,
  author       = {Tatsuya Akutsu and
                  Takeyuki Tamura and
                  Daiji Fukagawa and
                  Atsuhiro Takasu},
  title        = {Efficient exponential-time algorithms for edit distance between unordered
                  trees},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {79--93},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2013.09.001},
  doi          = {10.1016/J.JDA.2013.09.001},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/AkutsuTFT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleGSV14,
  author       = {Philip Bille and
                  Inge Li G{\o}rtz and
                  Benjamin Sach and
                  Hjalte Wedel Vildh{\o}j},
  title        = {Time-space trade-offs for longest common extensions},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {42--50},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2013.06.003},
  doi          = {10.1016/J.JDA.2013.06.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BilleGSV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DondiES14,
  author       = {Riccardo Dondi and
                  Nadia El{-}Mabrouk and
                  Krister M. Swenson},
  title        = {Gene tree correction for reconciliation and species tree inference:
                  Complexity and algorithms},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {51--65},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2013.06.001},
  doi          = {10.1016/J.JDA.2013.06.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/DondiES14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gawrychowski14,
  author       = {Pawel Gawrychowski},
  title        = {Simple and efficient LZW-compressed multiple pattern matching},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {34--41},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2013.10.004},
  doi          = {10.1016/J.JDA.2013.10.004},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Gawrychowski14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JanssonL14,
  author       = {Jesper Jansson and
                  Andrzej Lingas},
  title        = {Computing the rooted triplet distance between galled trees by counting
                  triangles},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {66--78},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2013.10.002},
  doi          = {10.1016/J.JDA.2013.10.002},
  timestamp    = {Tue, 17 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/JanssonL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Navarro14,
  author       = {Gonzalo Navarro},
  title        = {Wavelet trees for all},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {2--20},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2013.07.004},
  doi          = {10.1016/J.JDA.2013.07.004},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Navarro14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OhlebuschBA14,
  author       = {Enno Ohlebusch and
                  Timo Beller and
                  Mohamed Ibrahim Abouelhoda},
  title        = {Computing the Burrows-Wheeler transform of a string and its reverse
                  in parallel},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {21--33},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2013.06.002},
  doi          = {10.1016/J.JDA.2013.06.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/OhlebuschBA14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/StoyeK14,
  author       = {Jens Stoye and
                  Juha K{\"{a}}rkk{\"{a}}inen},
  title        = {Editorial},
  journal      = {J. Discrete Algorithms},
  volume       = {25},
  pages        = {1},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jda.2014.01.003},
  doi          = {10.1016/J.JDA.2014.01.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/StoyeK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics