P. Buneman, S. Khanna, K. Tajima, and W. Tan, Archiving scientific data, ACM Transactions on Database Systems, vol.29, issue.1, pp.2-42, 2004.
DOI : 10.1145/974750.974752
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.6862

F. Emmert-streib, M. Dehmer, and Y. Shi, Fifty years of graph matching, network alignment and network comparison, Information Sciences, vol.346, issue.347, pp.180-197, 2016.
DOI : 10.1016/j.ins.2016.01.074

A. Y. Halevy, A. Rajaraman, and J. J. Ordille, Data integration: The teenage years, International Conference on Very Large Data Bases (VLDB), pp.9-16, 2006.

A. J. Harmar, IUPHAR-DB: the IUPHAR database of G protein-coupled receptors and ion channels, Nucleic Acids Research, vol.37, issue.Database, pp.680-685, 2009.
DOI : 10.1093/nar/gkn728

A. Hogan, M. Arenas, A. Mallea, and A. Polleres, Everything you always wanted to know about blank nodes, Web Semantics: Science, Services and Agents on the World Wide Web, pp.42-69, 2014.
DOI : 10.1016/j.websem.2014.06.004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.665.2484

X. Huang, A lower bound for the edit-distance problem under an arbitrary cost function, Information Processing Letters, vol.27, issue.6, pp.319-321, 1988.
DOI : 10.1016/0020-0190(88)90220-7

D. Justice and A. Hero, A binary linear programming formulation of the graph edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.8, pp.1200-1214, 2006.
DOI : 10.1109/TPAMI.2006.152

H. Köpcke and E. Rahm, Frameworks for entity matching: A comparison, Data & Knowledge Engineering, vol.69, issue.2, pp.197-210, 2010.
DOI : 10.1016/j.datak.2009.10.003

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics, vol.52, issue.1, pp.7-21, 2005.
DOI : 10.1002/nav.20053

C. Lantzaki and Y. Tzitzikas, Tasks that require, or can benefit from, matching blank nodes. CoRR, abs, 1410.

J. Malone, Modeling sample variables with an Experimental Factor Ontology, Bioinformatics, vol.26, issue.8, pp.1112-1118, 2010.
DOI : 10.1093/bioinformatics/btq099
URL : https://hal.archives-ouvertes.fr/hal-00721833

S. Melnik, H. Garcia-molina, and E. Rahm, Similarity flooding: a versatile graph matching algorithm and its application to schema matching, Proceedings 18th International Conference on Data Engineering, pp.117-128, 2002.
DOI : 10.1109/ICDE.2002.994702

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

V. Papavasileiou, G. Flouris, I. Fundulaki, D. Kotzinos, and V. Christophides, High-level change detection in RDF(S) KBs, ACM Transactions on Database Systems, vol.38, issue.1, p.1, 2013.
DOI : 10.1145/2445583.2445584

E. Rahm and H. H. Do, Data cleaning: Problems and current approaches, IEEE Data Engineering Bulletin, vol.23, issue.4, pp.3-13, 2000.

A. Schätzle, A. Neu, G. Lausen, and M. Przyjaciel-zablocki, Large-scale bisimulation of RDF graphs, Proceedings of the Fifth Workshop on Semantic Web Information Management, SWIM '13, p.1, 2013.
DOI : 10.1145/2484712.2484713

Y. Tzitzikas, C. Lantzaki, and D. Zeginis, Blank Node Matching and RDF/S Comparison Functions, International Semantic Web Conference (ISWC), pp.591-607, 2012.
DOI : 10.1007/978-3-642-35176-1_37

C. Wong and A. K. Chandra, Bounds for the String Editing Problem, Journal of the ACM, vol.23, issue.1, pp.13-16, 1976.
DOI : 10.1145/321921.321923

D. Zeginis, Y. Tzitzikas, and V. Christophides, On Computing Deltas of RDF/S Knowledge Bases, ACM Transactions on the Web, vol.5, issue.3, 2011.
DOI : 10.1145/1993053.1993056