Search dblp for Publications

export results for "toc:db/journals/tcs/tcs638.bht:"

 download as .bib file

@article{DBLP:journals/tcs/ApostolicoGLP16,
  author       = {Alberto Apostolico and
                  Concettina Guerra and
                  Gad M. Landau and
                  Cinzia Pizzi},
  title        = {Sequence similarity measures based on bounded hamming distance},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {76--90},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.023},
  doi          = {10.1016/J.TCS.2016.01.023},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ApostolicoGLP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BabenkoGKKS16,
  author       = {Maxim A. Babenko and
                  Pawel Gawrychowski and
                  Tomasz Kociumaka and
                  Ignat I. Kolesnichenko and
                  Tatiana Starikovskaya},
  title        = {Computing minimal and maximal suffixes of a substring},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {112--121},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.023},
  doi          = {10.1016/J.TCS.2015.08.023},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BabenkoGKKS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BeigelG16,
  author       = {Richard Beigel and
                  William I. Gasarch},
  title        = {On the sizes of DPDAs, PDAs, LBAs},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {63--75},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.028},
  doi          = {10.1016/J.TCS.2015.08.028},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BeigelG16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BensonFLP16,
  author       = {Gary Benson and
                  Martin Farach{-}Colton and
                  Moshe Lewenstein and
                  Ely Porat},
  title        = {Special issue in honor of the 60th birthday of Amihood Amir},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {1--2},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.05.039},
  doi          = {10.1016/J.TCS.2016.05.039},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BensonFLP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BensonLMNS16,
  author       = {Gary Benson and
                  Avivit Levy and
                  S. Maimoni and
                  D. Noifeld and
                  B. Riva Shalom},
  title        = {LCSk: {A} refined similarity measure},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {11--26},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.11.026},
  doi          = {10.1016/J.TCS.2015.11.026},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BensonLMNS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BilleGGLW16,
  author       = {Philip Bille and
                  Pawel Gawrychowski and
                  Inge Li G{\o}rtz and
                  Gad M. Landau and
                  Oren Weimann},
  title        = {Longest common extensions in trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {98--107},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.009},
  doi          = {10.1016/J.TCS.2015.08.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BilleGGLW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BrodalDLRS16,
  author       = {Gerth St{\o}lting Brodal and
                  Pooya Davoodi and
                  Moshe Lewenstein and
                  Rajeev Raman and
                  Srinivasa Rao Satti},
  title        = {Two dimensional range minimum queries and Fibonacci lattices},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {33--43},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.016},
  doi          = {10.1016/J.TCS.2016.02.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BrodalDLRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ButmanLM16,
  author       = {Ayelet Butman and
                  Noa Lewenstein and
                  J. Ian Munro},
  title        = {Permuted scaled matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {27--32},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.036},
  doi          = {10.1016/J.TCS.2016.02.036},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ButmanLM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CrochemoreEGM16,
  author       = {Maxime Crochemore and
                  Chiara Epifanio and
                  Roberto Grossi and
                  Filippo Mignosi},
  title        = {Linear-size suffix tries},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {171--178},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.04.002},
  doi          = {10.1016/J.TCS.2016.04.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CrochemoreEGM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CrochemoreIKKLP16,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Alessio Langiu and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Order-preserving indexing},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {122--135},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.06.050},
  doi          = {10.1016/J.TCS.2015.06.050},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CrochemoreIKKLP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GawrychowskiU16,
  author       = {Pawel Gawrychowski and
                  Przemyslaw Uznanski},
  title        = {Order-preserving pattern matching with k mismatches},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {136--144},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.022},
  doi          = {10.1016/J.TCS.2015.08.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GawrychowskiU16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KleinS16,
  author       = {Shmuel T. Klein and
                  Dana Shapira},
  title        = {Compressed matching for feature vectors},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {52--62},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.021},
  doi          = {10.1016/J.TCS.2015.12.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KleinS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Kopelowitz16,
  author       = {Tsvi Kopelowitz},
  title        = {The property suffix tree with dynamic properties},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {44--51},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.033},
  doi          = {10.1016/J.TCS.2016.02.033},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Kopelowitz16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KucherovST16,
  author       = {Gregory Kucherov and
                  Kamil Salikhov and
                  Dekel Tsur},
  title        = {Approximate string matching using a bidirectional index},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {145--158},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.10.043},
  doi          = {10.1016/J.TCS.2015.10.043},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KucherovST16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MunroNV16,
  author       = {J. Ian Munro and
                  Yakov Nekrich and
                  Jeffrey Scott Vitter},
  title        = {Fast construction of wavelet trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {91--97},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.11.011},
  doi          = {10.1016/J.TCS.2015.11.011},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MunroNV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NaKPLLMP16,
  author       = {Joong Chae Na and
                  Hyunjoon Kim and
                  Heejin Park and
                  Thierry Lecroq and
                  Martine L{\'{e}}onard and
                  Laurent Mouchard and
                  Kunsoo Park},
  title        = {FM-index of alignment: {A} compressed index for similar strings},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {159--170},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.008},
  doi          = {10.1016/J.TCS.2015.08.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NaKPLLMP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NavarroT16,
  author       = {Gonzalo Navarro and
                  Sharma V. Thankachan},
  title        = {Reporting consecutive substring occurrences under bounded gap constraints},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {108--111},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.005},
  doi          = {10.1016/J.TCS.2016.02.005},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NavarroT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ShiftanP16,
  author       = {Ariel Shiftan and
                  Ely Porat},
  title        = {Set Intersection and Sequence Matching with mismatch counting},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {3--10},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.003},
  doi          = {10.1016/J.TCS.2016.01.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ShiftanP16.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.