A Real Linear and Parallel Multiple Longest Common Subsequences (MLCS) Algorithm. Li, Y., Li, H., Duan, T., Wang, S., Wang, Z., & Cheng, Y. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016, pages 1725–1734, 2016. CCF A
doi  bibtex   1 download  
@InProceedings{DBLP:conf/kdd/LiLDWWC16,
  author       = {Yanni Li and Hui Li and Tihua Duan and Sheng Wang and Zhi Wang and Yang Cheng},
  title        = {A Real Linear and Parallel Multiple Longest Common Subsequences {(MLCS)} Algorithm},
  booktitle    = {Proceedings of the 22nd {ACM} {SIGKDD} International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016},
  year         = {2016},
  pages        = {1725--1734},
  bibbase_note = {<b class="ui orange label">CCF A</b>},
  bibsource    = {dblp computer science bibliography, http://dblp.org},
  biburl       = {http://dblp.uni-trier.de/rec/bib/conf/kdd/LiLDWWC16},
  crossref     = {DBLP:conf/kdd/2016},
  doi          = {10.1145/2939672.2939842},
  timestamp    = {Tue, 09 Aug 2016 09:42:25 +0200},
}

Downloads: 1