Advanced

A fast algorithm for optimal alignment between similar ordered trees

Jansson, Jesper LU and Lingas, Andrzej LU (2001) 12th Annual Symposium, CPM 2001 In Combinatorial Pattern Matching / Lecture notes in computer science 2089. p.232-240
Please use this url to cite or link to this publication:
author
organization
publishing date
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
in
Combinatorial Pattern Matching / Lecture notes in computer science
volume
2089
pages
232 - 240
publisher
Springer
conference name
12th Annual Symposium, CPM 2001
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
2007-09-20 09:31:46
date last changed
2016-10-13 04:49:59
@misc{da0e9dbc-bf7a-44ff-b690-2381069f73b1,
  author       = {Jansson, Jesper and Lingas, Andrzej},
  isbn         = {3540422714},
  keyword      = {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    = {ARRAY(0x91fe9d0)},
  series       = {Combinatorial Pattern Matching / Lecture notes in computer science},
  title        = {A fast algorithm for optimal alignment between similar ordered trees},
  url          = {http://dx.doi.org/10.1007/3-540-48194-X_22},
  volume       = {2089},
  year         = {2001},
}