Shortest Path Edit Distance for detecting duplicate biological entities

Document Type

Conference Proceeding

Publication Date

10-25-2010

Abstract

This paper presents a novel and context-sensitive Shortest Path Edit Distance (SPED) applied to duplicate entity detection in biological data. SPED is an extension of Markov Random Field-based Edit Distance. It transforms the edit distance computational problem to the calculation of the shortest path among two selected vertices of a graph. The experimental results show that SPED produces competitive outcomes. Soft-SPED, the combination of SPED with TFIDF, achieves superior performance in most cases. Copyright © 2010 ACM.

Identifier

77958028272 (Scopus)

ISBN

[9781450304382]

Publication Title

2010 ACM International Conference on Bioinformatics and Computational Biology ACM Bcb 2010

External Full Text Location

https://doi.org/10.1145/1854776.1854851

First Page

442

Last Page

444

This document is currently not available here.

Share

COinS