A framework for succinct labeled ordinal trees over large alphabets

Meng He; J. Ian Munro; Gelin Zhou

doi:10.1007/978-3-642-35261-4_56

A framework for succinct labeled ordinal trees over large alphabets

Meng He, J. Ian Munro, Gelin Zhou

Earth and Planetary Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Original language	English
Title of host publication	Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings
Publisher	Springer Verlag
Pages	537-547
Number of pages	11
ISBN (Print)	9783642352607
DOIs	https://doi.org/10.1007/978-3-642-35261-4_56
Publication status	Published - 2012
Event	23rd International Symposium on Algorithms and Computation, ISAAC 2012 - Taipei, Taiwan, Province of China Duration: Dec 19 2012 → Dec 21 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7676 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	23rd International Symposium on Algorithms and Computation, ISAAC 2012
Country/Territory	Taiwan, Province of China
City	Taipei
Period	12/19/12 → 12/21/12

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-35261-4_56

Cite this

He, M., Munro, J. I., & Zhou, G. (2012). A framework for succinct labeled ordinal trees over large alphabets. In Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings (pp. 537-547). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7676 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_56

A framework for succinct labeled ordinal trees over large alphabets. / He, Meng; Munro, J. Ian; Zhou, Gelin.
Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Springer Verlag, 2012. p. 537-547 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7676 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

He, M, Munro, JI & Zhou, G 2012, A framework for succinct labeled ordinal trees over large alphabets. in Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7676 LNCS, Springer Verlag, pp. 537-547, 23rd International Symposium on Algorithms and Computation, ISAAC 2012, Taipei, Taiwan, Province of China, 12/19/12. https://doi.org/10.1007/978-3-642-35261-4_56

He M, Munro JI, Zhou G. A framework for succinct labeled ordinal trees over large alphabets. In Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Springer Verlag. 2012. p. 537-547. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-35261-4_56

@inproceedings{155b66fb56a74d33a4e4728a2732118a,

title = "A framework for succinct labeled ordinal trees over large alphabets",

author = "Meng He and Munro, {J. Ian} and Gelin Zhou",

note = "Funding Information: This work was supported by NSERC and the Canada Research Chairs Program.; 23rd International Symposium on Algorithms and Computation, ISAAC 2012 ; Conference date: 19-12-2012 Through 21-12-2012",

year = "2012",

doi = "10.1007/978-3-642-35261-4_56",

language = "English",

isbn = "9783642352607",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "537--547",

booktitle = "Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings",

address = "Germany",

}

TY - GEN

T1 - A framework for succinct labeled ordinal trees over large alphabets

AU - He, Meng

AU - Munro, J. Ian

AU - Zhou, Gelin

N1 - Funding Information: This work was supported by NSERC and the Canada Research Chairs Program.

PY - 2012

Y1 - 2012

UR - http://www.scopus.com/inward/record.url?scp=84871532921&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871532921&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-35261-4_56

DO - 10.1007/978-3-642-35261-4_56

M3 - Conference contribution

AN - SCOPUS:84871532921

SN - 9783642352607

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 537

EP - 547

BT - Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings

PB - Springer Verlag

T2 - 23rd International Symposium on Algorithms and Computation, ISAAC 2012

Y2 - 19 December 2012 through 21 December 2012

ER -

A framework for succinct labeled ordinal trees over large alphabets

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this