A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Performance Comparison of Five Exact Graph Matching Algorithms on Biological Databases
[chapter]
2013
Lecture Notes in Computer Science
Graphs are a powerful data structure that can be applied to several problems in bioinformatics. Graph matching, in its diverse forms, is an important operation on graphs, involved when there is the need to compare two graphs or to find substructures into larger structures. Many graph matching algorithms exist, and their relative efficiency depends on the kinds of graphs they are applied to. In this paper we will consider some popular and freely available matching algorithms, and will
doi:10.1007/978-3-642-41190-8_44
fatcat:5m5uvkeparfbrfkpo5cdui7qfm