Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. Hermelin, D., Landau, G. M., Rabinovich, Y., & Weimann, O. CoRR, 2014.
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths [link]Paper  bibtex   
@article{DBLP:journals/corr/HermelinLRW14,
  author    = {Danny Hermelin and
               Gad M. Landau and
               Yuri Rabinovich and
               Oren Weimann},
  title     = {Binary Jumbled Pattern Matching via All-Pairs Shortest Paths},
  journal   = {CoRR},
  volume    = {abs/1401.2065},
  year      = {2014},
  url       = {http://arxiv.org/abs/1401.2065},
  archivePrefix = {arXiv},
  eprint    = {1401.2065},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/HermelinLRW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0