Search dblp for Publications

• > Home > Search

@article{DBLP:journals/jda/AdamczykR13,
  author       = {Zbigniew Adamczyk and
                  Wojciech Rytter},
  title        = {A note on a simple computation of the maximal suffix of a string},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {61--64},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2013.03.002},
  doi          = {10.1016/J.JDA.2013.03.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/AdamczykR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/Badkobeh13,
  author       = {Golnaz Badkobeh},
  title        = {Infinite words containing the minimal number of repetitions},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {38--42},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2013.03.001},
  doi          = {10.1016/J.JDA.2013.03.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Badkobeh13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/BakerDF13,
  author       = {Andrew Baker and
                  Antoine Deza and
                  Frantisek Franek},
  title        = {A computational framework for determining run-maximal strings},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {43--50},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2012.12.004},
  doi          = {10.1016/J.JDA.2012.12.004},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BakerDF13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/ChristouFIJMPZ13,
  author       = {Michalis Christou and
                  Tom{\'{a}}s Flouri and
                  Costas S. Iliopoulos and
                  Jan Janousek and
                  Borivoj Melichar and
                  Solon P. Pissis and
                  Jan Zd{\'{a}}rek},
  title        = {Tree template matching in unranked ordered trees},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {51--60},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2013.02.001},
  doi          = {10.1016/J.JDA.2013.02.001},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/ChristouFIJMPZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/CrochemoreD13,
  author       = {Maxime Crochemore and
                  Jacqueline W. Daykin},
  title        = {StringMasters 2011 Special Issue},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {1--2},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2013.05.001},
  doi          = {10.1016/J.JDA.2013.05.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/CrochemoreD13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/Kucherov13,
  author       = {Gregory Kucherov},
  title        = {On-line construction of position heaps},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {3--11},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2012.08.002},
  doi          = {10.1016/J.JDA.2012.08.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Kucherov13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/Langiu13,
  author       = {Alessio Langiu},
  title        = {On parsing optimality for dictionary-based text compression - the
                  Zip case},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {65--70},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2013.04.001},
  doi          = {10.1016/J.JDA.2013.04.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Langiu13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/MoosaRZ13,
  author       = {Johra Muhammad Moosa and
                  M. Sohel Rahman and
                  Fatema Tuz Zohora},
  title        = {Computing a longest common subsequence that is almost increasing on
                  sequences having no repeated elements},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {12--20},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2012.12.005},
  doi          = {10.1016/J.JDA.2012.12.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/MoosaRZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/RidderKWFR13,
  author       = {Corn{\'{e}} de Ridder and
                  Derrick G. Kourie and
                  Bruce W. Watson and
                  T. R. Fourie and
                  P. V. Reyneke},
  title        = {Fine-tuning the search for microsatellites},
  journal      = {J. Discrete Algorithms},
  volume       = {20},
  pages        = {21--37},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jda.2012.12.007},
  doi          = {10.1016/J.JDA.2012.12.007},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/RidderKWFR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}