Object

Title: LCS Algorithm for Big Data Flows1

Co-author(s) :

Minasyan Vahagn

Abstract:

The Longest Common Subsequence (LCS) problem is aimed at constructing a maximum length subsequence, common to a given set of sequences, defined on some finite alphabet of symbols. The paper, without loss of generality considers the particular case of two input sequences. We consider the problem in an online fashion, where symbols arrive one-byone and the next acquired symbol is appending any one of the two input sequences. The sought-for LCS algorithm acts by recursive handling of parts of sequences arrival so far, constructing and updating specific structures of markers representing the interrelations of the longest common subsequences of the two input sequences. In paper we present a perfect online parallelization of that algorithm for the “simple” memory model, so that the parallel complexity becomes O �� � for � parallel threads.

Identifier:

oai:noad.sci.am:135796

Language:

English

URL:


Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Year:

2017

Time period:

September25-29

Conference title:

11th International Conference on Computer Science and Information Technologies CSIT 2017

Place:

Yerevan

Participation type:

oral

Object collections:

Last modified:

Mar 3, 2021

In our library since:

Jul 16, 2020

Number of object content hits:

4

All available object's versions:

https://noad.sci.am/publication/149323

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information