OpenAlex
PricingAboutJobs
Log inGet started
Work

A New Algorithm for Sparse Suffix Trees

HTML

Year: 2011
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Advances in Bioinformatics and Computational Biology: 6th Brazilian Symposium on Bioinformatics, BSB 2011, Brasilia, Brazil, August 10-12, 2011. Proceedings
DOI: 10.1007/978-3-642-22825-4_5
Authors: Gustavo Akio T. Sacomoto, Alair Pereira do Lago
Institutions: Lyon 1 Université, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Centre Inria de l'Université Grenoble Alpes, Laboratoire de Biométrie et Biologie Evolutive, Universidade de São Paulo
Language: English

Topic: Algorithms and Data Compression
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: suffix tree construction, optimal algorithms, memory reduction, string data structures, bioinformatics applications

Open Access status: closed
OpenAlex ID: W2152554512
FWCI: 0.204
Cites: 13
Cited by: 1
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security