English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we will describe a new approach on the well-known suffix-arrayalgorithm using Big Table Data Technology. We will demonstrate how it ispossible to refactor a well-known algorithm coupled by taking advantage of anhigh-performance distributed datastore, to illustrate the advantages of usingdatastore cloud related technology for storing large text sequences andretrieving them. A case study using DNA strings, considered one of the mostdifficult pattern matching problem, will be described and evaluated todemonstrate the potentiality of this implementation. Further discussion onperformances and other big data related issues will be described as well as newpossible lines of research in big data technology for precise medicalapplications.

Implementing Suffix Array Algorithm Using Apache Big Table Data Implementation