Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings > Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)
String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings |
Gabriele Fici; Marinella Sciortino; Rossano Venturini
Springer International Publishing
String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)
Authors

Cedric Chauve; Mark Jones; Manuel Lafond; Céline Scornavacca; Mathias Weller

ARI Id

1664722750834_2929464

Access

Not Available Free

Pages

129-143

DOI

10.1007/978-3-319-67428-5_12

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-67428-5_12

Table of Contents of Book
Showing 1 to 20 of 28 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XIX
Greedy Shortest Common Superstring Approximation in Compact Space
Jarno Alanko; Tuukka Norri
1-13
Longest Common Factor After One Edit Operation
Amihood Amir; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski
14-26
Distinct Squares in Circular Words
Mika Amit; Paweł Gawrychowski
27-37
LZ78 Compression in Low Main Memory Space
Diego Arroyuelo; Rodrigo Cánovas; Gonzalo Navarro; Rajeev Raman
38-50
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
Golnaz Badkobeh; Travis Gagie; Shunsuke Inenaga; Tomasz Kociumaka; Dmitry Kosolobov; Simon J. Puglisi
51-67
On Suffix Tree Breadth
Golnaz Badkobeh; Juha Kärkkäinen; Simon J. Puglisi; Bella Zhukova
68-73
Pattern Matching on Elastic-Degenerate Text with Errors
Giulia Bernardini; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone
74-90
Succinct Partial Sums and Fenwick Trees
Philip Bille; Anders Roy Christiansen; Nicola Prezza; Frederik Rye Skjoldjensen
91-96
Tight Bounds for Top Tree Compression
Philip Bille; Finn Fernstrøm; Inge Li Gørtz
97-102
Efficient Compression and Indexing of Trajectories
Nieves R. Brisaboa; Travis Gagie; Adrián Gómez-Brandón; Gonzalo Navarro; José R. Paramá
103-115
Fast Construction of Compressed Web Graphs
Jan Broß; Simon Gog; Matthias Hauck; Marcus Paradies
116-128
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)
Cedric Chauve; Mark Jones; Manuel Lafond; Céline Scornavacca; Mathias Weller
129-143
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
Alessio Conte; Roberto Grossi; Andrea Marino; Takeaki Uno; Luca Versari
144-160
Fast Label Extraction in the CDAWG
Djamal Belazzougui; Fabio Cunial
161-175
Lightweight BWT and LCP Merging via the Gap Algorithm
Lavinia Egidi; Giovanni Manzini
176-190
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
Johannes Fischer; Dominik Köppl
191-207
Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings
Szymon Grabowski
208-213
Mining Bit-Parallel LCS-length Algorithms
Heikki Hyyrö
214-220
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
Shunsuke Kanda; Kazuhiro Morita; Masao Fuketa
221-233
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 28 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings