Openly accessible

String edit distance, random walks and graph matching

Robles-Kelly, Antonio and Hancock, ER 2002, String edit distance, random walks and graph matching, in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Berlin Heidelberg,, pp. 104-112, doi: 10.1007/3-540-70659-3_10.


Title String edit distance, random walks and graph matching
Author(s) Robles-Kelly, AntonioORCID iD for Robles-Kelly, Antonio orcid.org/0000-0002-2465-5971
Hancock, ER
Title of proceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication date 2002-01-01
Start page 104
End page 112
Total pages 9
Publisher Springer Berlin Heidelberg
ISBN 3540440119
9783540440116
ISSN 0302-9743
1611-3349
DOI 10.1007/3-540-70659-3_10
HERDC Research category E1.1 Full written paper - refereed
Free to Read? Yes
Persistent URL http://hdl.handle.net/10536/DRO/DU:30156546

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 6 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 4 Abstract Views  -  Detailed Statistics
Created: Thu, 07 Oct 2021, 08:24:28 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.