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]Link  Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. [link]Paper  bibtex   
@article{journals/corr/HermelinLRW14,
  added-at = {2018-08-13T00:00:00.000+0200},
  author = {Hermelin, Danny and Landau, Gad M. and Rabinovich, Yuri and Weimann, Oren},
  biburl = {https://www.bibsonomy.org/bibtex/208d8aee0ca31c10111f289d363b4c5aa/dblp},
  ee = {http://arxiv.org/abs/1401.2065},
  interhash = {ca68a7bfba21bec0dc89c198df6a1250},
  intrahash = {08d8aee0ca31c10111f289d363b4c5aa},
  journal = {CoRR},
  keywords = {dblp},
  timestamp = {2018-08-14T14:45:42.000+0200},
  title = {Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1401.html#HermelinLRW14},
  volume = {abs/1401.2065},
  year = 2014
}

Downloads: 0