BibTeX record journals/tcs/EvansSW03

download as .bib file

@article{DBLP:journals/tcs/EvansSW03,
  author       = {Patricia A. Evans and
                  Andrew D. Smith and
                  Harold T. Wareham},
  title        = {On the complexity of finding common approximate substrings},
  journal      = {Theor. Comput. Sci.},
  volume       = {306},
  number       = {1-3},
  pages        = {407--430},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(03)00320-7},
  doi          = {10.1016/S0304-3975(03)00320-7},
  timestamp    = {Tue, 01 Jun 2021 10:00:03 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/EvansSW03.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.