Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,575,600 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

A weighted string, also known as a position weight matrix, is a sequence of probability distributions over some alphabet. We…

2016

2016

The Shortest Common Supersequence problem is an NP-hard optimization problem that has a vast use in real world problems. It is…

Highly Cited

2014

Highly Cited

2014

A bstractWe consider γ-deformations of the AdS5×S5 superstring as Yang-Baxter sigma models with classical r-matrices satisfying…

2007

2007

The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many…

2005

2005

The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. We…

2001

2001

In this paper, the problem of finding the shortest common supersequence (SCS) of a set of sequences is considered. The SCS…

2001

2001

In this paper an approximation algorithm, called ReduceExpand, for the Shortest Common Supersequence (SCS) problem is presented…

Highly Cited

1995

Highly Cited

1995

Finding shortest common supersequences (SCS) and longest common subsequences (LCS) for a given set of sequences are two well…

Highly Cited

1988

Highly Cited

1981