Normalized Sum-Over-Paths Edit Distances

Abstract--In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are variants of the Sum-over-Paths (SoP) distances which compute the expected cost on all sequence alignments by favoring lowcost ones

• Type: Conference
• Year: 2010
• Where: ICPR
• Authors: Silvia García, François Fouss, Masashi Shimbo, Marco Saerens
• Keywords: Computer Vision, ICPR 2010, Longest Common Subsequence, Normalized Sop, SoP String-edit Distances