Inducing the Document Array

The document array is a simple data structure commonly used together with the suffix array when indexing string collections. It determines to which document each suffix in the lexicographic order belongs. There exist algorithms to compute the document arr

  • PDF / 3,167,253 Bytes
  • 107 Pages / 439.43 x 666.14 pts Page_size
  • 12 Downloads / 249 Views

DOWNLOAD

REPORT


Felipe A. Louza Simon Gog Guilherme P. Telles

Construction of Fundamental Data Structures for Strings

1 23

SpringerBriefs in Computer Science Series Editors Stan Zdonik, Brown University, Providence, RI, USA Shashi Shekhar, University of Minnesota, Minneapolis, MN, USA Xindong Wu, University of Vermont, Burlington, VT, USA Lakhmi C. Jain, University of South Australia, Adelaide, SA, Australia David Padua, University of Illinois Urbana-Champaign, Urbana, IL, USA Xuemin Sherman Shen, University of Waterloo, Waterloo, ON, Canada Borko Furht, Florida Atlantic University, Boca Raton, FL, USA V. S. Subrahmanian, University of Maryland, College Park, MD, USA Martial Hebert, Carnegie Mellon University, Pittsburgh, PA, USA Katsushi Ikeuchi, University of Tokyo, Tokyo, Japan Bruno Siciliano, Università di Napoli Federico II, Napoli, Italy Sushil Jajodia, George Mason University, Fairfax, VA, USA Newton Lee, Institute for Education, Research and Scholarships, Los Angeles, CA, USA

SpringerBriefs present concise summaries of cutting-edge research and practical applications across a wide spectrum of fields. Featuring compact volumes of 50 to 125 pages, the series covers a range of content from professional to academic. Typical topics might include: • A timely report of state-of-the art analytical techniques • A bridge between new research results, as published in journal articles, and a contextual literature review • A snapshot of a hot or emerging topic • An in-depth case study or clinical example • A presentation of core concepts that students must understand in order to make independent contributions Briefs allow authors to present their ideas and readers to absorb them with minimal time investment. Briefs will be published as part of Springer’s eBook collection, with millions of users worldwide. In addition, Briefs will be available for individual print and electronic purchase. Briefs are characterized by fast, global electronic dissemination, standard publishing contracts, easy-to-use manuscript preparation and formatting guidelines, and expedited production schedules. We aim for publication 8–12 weeks after acceptance. Both solicited and unsolicited manuscripts are considered for publication in this series. This series is indexed in Scopus.

More information about this series at http://www.springer.com/series/10028

Felipe A. Louza • Simon Gog • Guilherme P. Telles

Construction of Fundamental Data Structures for Strings

Felipe A. Louza Faculty of Electrical Engineering Federal University of Uberlˆandia Uberlˆandia, Minas Gerais, Brazil

Simon Gog eBay (United States) San Jose, CA, USA

Guilherme P. Telles Institute of Computing University of Campinas Campinas, S˜ao Paulo, Brazil

ISSN 2191-5768 ISSN 2191-5776 (electronic) SpringerBriefs in Computer Science ISBN 978-3-030-55107-0 ISBN 978-3-030-55108-7 (eBook) https://doi.org/10.1007/978-3-030-55108-7 © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2020 This work is subject to copyright. All rights are solely and exclusively licensed by