Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

Free burnside semigroups

Alair Pereira Do LagoImre Simon — 2001

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper surveys the area of Free Burnside Semigroups. The theory of these semigroups, as is the case for groups, is far from being completely known. For semigroups, the most impressive results were obtained in the last 10 years. In this paper we give priority to the mathematical treatment of the problem and do not stress too much neither motivation nor the historical aspects. No proofs are presented in this paper, but we tried to give as many examples as was possible.

Free Burnside Semigroups

Alair Pereira do LagoImre Simon — 2010

RAIRO - Theoretical Informatics and Applications

This paper surveys the area of Free Burnside Semigroups. The theory of these semigroups, as is the case for groups, is far from being completely known. For semigroups, the most impressive results were obtained in the last 10 years. In this paper we give priority to the mathematical treatment of the problem and do not stress too much neither motivation nor the historical aspects. No proofs are presented in this paper, but we tried to give as many examples as was possible.

A sparse dynamic programming algorithm for alignment with non-overlapping inversions

Alair Pereira Do LagoIlya MuchnikCasimir Kulikowski — 2005

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Alignment of sequences is widely used for biological sequence comparisons, and only biological events like mutations, insertions and deletions are considered. Other biological events like inversions are not automatically detected by the usual alignment algorithms, thus some alternative approaches have been tried in order to include inversions or other kinds of rearrangements. Despite many important results in the last decade, the complexity of the problem of alignment with inversions is still unknown....

A sparse dynamic programming algorithm for alignment with non-overlapping inversions

Alair Pereira do LagoIlya MuchnikCasimir Kulikowski — 2010

RAIRO - Theoretical Informatics and Applications

Alignment of sequences is widely used for biological sequence comparisons, and only biological events like mutations, insertions and deletions are considered. Other biological events like inversions are not automatically detected by the usual alignment algorithms, thus some alternative approaches have been tried in order to include inversions or other kinds of rearrangements. Despite many important results in the last decade, the complexity of the problem of alignment with inversions is...

Page 1

Download Results (CSV)