A fast algorithm for optimal alignment between similar ordered trees

Jesper Jansson; Andrzej Lingas

doi:10.1007/3-540-48194-X_22

A fast algorithm for optimal alignment between similar ordered trees

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

209 Downloads (Pure)

Original language	English
Title of host publication	Combinatorial Pattern Matching / Lecture notes in computer science
Publisher	Springer
Pages	232-240
Volume	2089
ISBN (Print)	3540422714
DOIs	https://doi.org/10.1007/3-540-48194-X_22
Publication status	Published - 2001
Event	12th Annual Symposium, CPM 2001 - Jerusalem, Israel Duration: 2001 Jul 1 → 2001 Jul 4

Publication series

Name
Volume	2089

Conference

Conference	12th Annual Symposium, CPM 2001
Country/Territory	Israel
City	Jerusalem
Period	2001/07/01 → 2001/07/04

Subject classification (UKÄ)

Computer Sciences

Free keywords

Data Compression
Searching
Computational Discrete Mathematics
Complexity
Combinatorics
Combinatorial Pattern Matching
Coding
Approximation
Algorithms
Computational Graph Theory
String Matching
Similarity Searches

Access to Document

10.1007/3-540-48194-X_22

20890232

Cite this

@inproceedings{da0e9dbcbf7a44ffb6902381069f73b1,

title = "A fast algorithm for optimal alignment between similar ordered trees",

keywords = "Data Compression, Searching, Computational Discrete Mathematics, Complexity, Combinatorics, Combinatorial Pattern Matching, Coding, Approximation, Algorithms, Computational Graph Theory, String Matching, Similarity Searches",

author = "Jesper Jansson and Andrzej Lingas",

year = "2001",

doi = "10.1007/3-540-48194-X_22",

language = "English",

isbn = "3540422714",

volume = "2089",

publisher = "Springer",

pages = "232--240",

booktitle = "Combinatorial Pattern Matching / Lecture notes in computer science",

address = "Germany",

note = "12th Annual Symposium, CPM 2001 ; Conference date: 01-07-2001 Through 04-07-2001",

}

TY - GEN

T1 - A fast algorithm for optimal alignment between similar ordered trees

AU - Jansson, Jesper

AU - Lingas, Andrzej

PY - 2001

Y1 - 2001

KW - Data Compression

KW - Searching

KW - Computational Discrete Mathematics

KW - Complexity

KW - Combinatorics

KW - Combinatorial Pattern Matching

KW - Coding

KW - Approximation

KW - Algorithms

KW - Computational Graph Theory

KW - String Matching

KW - Similarity Searches

U2 - 10.1007/3-540-48194-X_22

DO - 10.1007/3-540-48194-X_22

M3 - Paper in conference proceeding

SN - 3540422714

VL - 2089

SP - 232

EP - 240

BT - Combinatorial Pattern Matching / Lecture notes in computer science

PB - Springer

T2 - 12th Annual Symposium, CPM 2001

Y2 - 1 July 2001 through 4 July 2001

ER -