A Fast longest crossing-plain preserving common subsequence algorithm
Crossref DOI link: https://doi.org/10.1007/s41870-022-01038-0
Published Online: 2022-08-22
Published Print: 2022-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kenawy, Tarek G.
Abdel-Rahman, Mohammad H. https://orcid.org/0000-0003-0145-1017
Bahig, Hazem M. https://orcid.org/0000-0001-9448-6168
Text and Data Mining valid from 2022-08-22
Version of Record valid from 2022-08-22
Article History
Received: 27 February 2022
Accepted: 7 July 2022
First Online: 22 August 2022