Abstract
Comparing birthmarks is necessary to identify similarities between software. If two birthmarks are similar, then the software is similar. Birthmarks may be compared to show similarity, or an alternative to showing similarity is to show dissimilarity or distance. Similarity measures and metrics exist for the different types of data such as strings, vectors, trees, graphs, etc. This chapter examines the different similarity measures and metrics for the different classes of birthmarks.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Peter NY (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth annual ACM-SIAM symposium on discrete algorithms, Austin, Texas, United States. Society for industrial and applied mathematics, pp 311–321
Vieira MR, Chino FJT, Traina C Jr., Traina AJM (2004) DBM-Tree: a dynamic metric access method sensitive to local density data. In: Brazilian symposium on databases, Brazil, pp 163–177
Paolo C, Marco P, Pavel Z (1997) M-tree: an efficient access method for similarity search in metric spaces. Paper presented at the proceedings of the 23rd international conference on very large data bases
Cilibrasi R, Vitányi PMB (2005) Clustering by compression. Inf Theory IEEE Trans 51(4):1523–1545
Brecheisen S (2007) Efficient and effective similarity search on complex objects. Ludwig-Maximilians-Universität München, Munich, Germany
Bille P (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337(1–3):217–239
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 The Author(s)
About this chapter
Cite this chapter
Cesare, S., Xiang, Y. (2012). Software Birthmark Similarity. In: Software Similarity and Classification. SpringerBriefs in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2909-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2909-7_8
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2908-0
Online ISBN: 978-1-4471-2909-7
eBook Packages: Computer ScienceComputer Science (R0)