Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/0001T13,
  author       = {Daniel G. Brown and
                  Jakub Truszkowski},
  title        = {Fast error-tolerant quartet phylogeny algorithms},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {104--114},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.016},
  doi          = {10.1016/J.TCS.2012.02.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/0001T13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BauerCR13,
  author       = {Markus J. Bauer and
                  Anthony J. Cox and
                  Giovanna Rosone},
  title        = {Lightweight algorithms for constructing and inverting the {BWT} of
                  string collections},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {134--148},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.002},
  doi          = {10.1016/J.TCS.2012.02.002},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BauerCR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BreslauerGM13,
  author       = {Dany Breslauer and
                  Roberto Grossi and
                  Filippo Mignosi},
  title        = {Simple real-time constant-space string matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {2--9},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.11.040},
  doi          = {10.1016/J.TCS.2012.11.040},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BreslauerGM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CantoneCF13,
  author       = {Domenico Cantone and
                  Salvatore Cristofaro and
                  Simone Faro},
  title        = {Efficient string-matching allowing for non-overlapping inversions},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {85--95},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.06.009},
  doi          = {10.1016/J.TCS.2012.06.009},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CantoneCF13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChristouCIKPRRSW13,
  author       = {Michalis Christou and
                  Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Bartosz Szreder and
                  Tomasz Walen},
  title        = {Efficient seed computation revisited},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {171--181},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2011.12.078},
  doi          = {10.1016/J.TCS.2011.12.078},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChristouCIKPRRSW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CliffordJPS13,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ely Porat and
                  Benjamin Sach},
  title        = {Space lower bounds for online pattern matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {68--74},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.06.012},
  doi          = {10.1016/J.TCS.2012.06.012},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CliffordJPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DaykinDS13,
  author       = {David E. Daykin and
                  Jacqueline W. Daykin and
                  W. F. Smyth},
  title        = {A linear partitioning algorithm for Hybrid Lyndons using \emph{V}V-order},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {149--161},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.001},
  doi          = {10.1016/J.TCS.2012.02.001},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DaykinDS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DondiFV13,
  author       = {Riccardo Dondi and
                  Guillaume Fertin and
                  St{\'{e}}phane Vialette},
  title        = {Finding approximate and constrained motifs in graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {10--21},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.08.023},
  doi          = {10.1016/J.TCS.2012.08.023},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DondiFV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ElberfeldSDSS13,
  author       = {Michael Elberfeld and
                  Danny Segev and
                  Colin R. Davidson and
                  Dana Silverbush and
                  Roded Sharan},
  title        = {Approximation algorithms for orienting mixed graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {96--103},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.044},
  doi          = {10.1016/J.TCS.2012.03.044},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ElberfeldSDSS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ferragina13,
  author       = {Paolo Ferragina},
  title        = {On the weak prefix-search problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {75--84},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.06.011},
  doi          = {10.1016/J.TCS.2012.06.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ferragina13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GagieKNP13,
  author       = {Travis Gagie and
                  Juha K{\"{a}}rkk{\"{a}}inen and
                  Gonzalo Navarro and
                  Simon J. Puglisi},
  title        = {Colored range queries and document retrieval},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {36--50},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.08.004},
  doi          = {10.1016/J.TCS.2012.08.004},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GagieKNP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GiancarloM13,
  author       = {Raffaele Giancarlo and
                  Giovanni Manzini},
  title        = {Foreword},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {1},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.12.022},
  doi          = {10.1016/J.TCS.2012.12.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GiancarloM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/IIT13,
  author       = {Tomohiro I and
                  Shunsuke Inenaga and
                  Masayuki Takeda},
  title        = {Palindrome pattern matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {162--170},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.047},
  doi          = {10.1016/J.TCS.2012.01.047},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/IIT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KreftN13,
  author       = {Sebastian Kreft and
                  Gonzalo Navarro},
  title        = {On compressing and indexing repetitive sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {115--133},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.006},
  doi          = {10.1016/J.TCS.2012.02.006},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KreftN13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SchirmerG13,
  author       = {Stefanie Schirmer and
                  Robert Giegerich},
  title        = {Forest alignment with affine gaps and anchors, applied in {RNA} structure
                  comparison},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {51--67},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.07.040},
  doi          = {10.1016/J.TCS.2012.07.040},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SchirmerG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Thachuk13,
  author       = {Chris Thachuk},
  title        = {Compressed indexes for text with wildcards},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {22--35},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.08.011},
  doi          = {10.1016/J.TCS.2012.08.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Thachuk13.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.