Peng, Z., & Wang, Y. (2017). A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem. Frontiers Media S.A.
Chicago Style (17th ed.) CitationPeng, Zhan, and Yuping Wang. A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem. Frontiers Media S.A, 2017.
MLA (8th ed.) CitationPeng, Zhan, and Yuping Wang. A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem. Frontiers Media S.A, 2017.
Warning: These citations may not always be 100% accurate.