A fast algorithm for optimal alignment between similar ordered trees
(2001) 12th Annual Symposium, CPM 2001 2089. p.232-240
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/526575
- author
- Jansson, Jesper LU and Lingas, Andrzej LU
- organization
- publishing date
- 2001
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Data Compression, Searching, Computational Discrete Mathematics, Complexity, Combinatorics, Combinatorial Pattern Matching, Coding, Approximation, Algorithms, Computational Graph Theory, String Matching, Similarity Searches
- host publication
- Combinatorial Pattern Matching / Lecture notes in computer science
- volume
- 2089
- pages
- 232 - 240
- publisher
- Springer
- conference name
- 12th Annual Symposium, CPM 2001
- conference location
- Jerusalem, Israel
- conference dates
- 2001-07-01 - 2001-07-04
- external identifiers
-
- scopus:84957024825
- ISBN
- 3540422714
- DOI
- 10.1007/3-540-48194-X_22
- language
- English
- LU publication?
- yes
- id
- da0e9dbc-bf7a-44ff-b690-2381069f73b1 (old id 526575)
- date added to LUP
- 2016-04-04 12:10:09
- date last changed
- 2022-02-28 21:01:32
@inproceedings{da0e9dbc-bf7a-44ff-b690-2381069f73b1, author = {{Jansson, Jesper and Lingas, Andrzej}}, booktitle = {{Combinatorial Pattern Matching / Lecture notes in computer science}}, isbn = {{3540422714}}, keywords = {{Data Compression; Searching; Computational Discrete Mathematics; Complexity; Combinatorics; Combinatorial Pattern Matching; Coding; Approximation; Algorithms; Computational Graph Theory; String Matching; Similarity Searches}}, language = {{eng}}, pages = {{232--240}}, publisher = {{Springer}}, title = {{A fast algorithm for optimal alignment between similar ordered trees}}, url = {{https://lup.lub.lu.se/search/files/5943326/623753.pdf}}, doi = {{10.1007/3-540-48194-X_22}}, volume = {{2089}}, year = {{2001}}, }