Wang, Q., Korkin, D., & Shang, Y. (2011). A Fast Multiple Longest Common Subsequence (MLCS) Algorithm. IEEE transactions on knowledge and data engineering, 23(3), 321-334. https://doi.org/10.1109/TKDE.2010.123
Citace podle Chicago (17th ed.)Wang, Qingguo, Dmitry Korkin, a Yi Shang. "A Fast Multiple Longest Common Subsequence (MLCS) Algorithm." IEEE Transactions on Knowledge and Data Engineering 23, no. 3 (2011): 321-334. https://doi.org/10.1109/TKDE.2010.123.
Citace podle MLA (9th ed.)Wang, Qingguo, et al. "A Fast Multiple Longest Common Subsequence (MLCS) Algorithm." IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 3, 2011, pp. 321-334, https://doi.org/10.1109/TKDE.2010.123.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..