Chen P.-HJIAN-JIUN DING2023-06-092023-06-0920220747668Xhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85127058419&doi=10.1109%2fICCE53296.2022.9730560&partnerID=40&md5=1c21e032a50b9aed6c1c7a827a95a0fbhttps://scholars.lib.ntu.edu.tw/handle/123456789/632450Dynamic programming (DP) is an effective algorithm to determine the similarity between two sequences. It plays an important role in text comparison, nucleotide sequence alignment, and melody matching. Conventional DP method performs element-to-element or element-to-space comparison and considers only the cases of replacement, deletion, and insertion. In this work, we improve the DP method by performing multiple element comparison. That is, in addition to perform element-wise comparison, we also compare the similarities of element-space to element and space-element to element. Moreover, the global similarity is also adopted to improve the accuracy of DP. Experiments show that, with the proposed algorithm, the accuracy of melody matching can be much improved. It is helpful for improving the performance of the query-by-humming system and applicable to other sequence comparison problems. © 2022 IEEE.dynamic programming; melody matching; query by humming; sequence comparison; similarity measurementDynamic programming algorithm; Dynamic programming methods; Effective algorithms; Matchings; Melody matching; Nucleotides sequences; Query by humming; Sequence alignments; Sequence comparisons; Similarity measurements; Dynamic programmingconference paper10.1109/ICCE53296.2022.97305602-s2.0-85127058419