Wyniki wyszukiwania - Biblioteka Nauki

Ten serwis zostanie wyłączony 2025-02-11.

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Motor unit involvement in scalene, strenocleidomastoid, and rectus abdominis muscles during eupnea, tachypnea, and bradypnea of sedentary young male adults: An observational study

100%

Chowdhury S. R. , Pathak R. , Chatterjee P. , Bandyopadhyay A.

nr 4

Computing a Longest Common Palindromic Subsequence

100%

Chowdhury S. R. , Hasan M. M. , Iqbal S. , Rahman M. S.

2014

tom Vol. 129, nr 4

329--340

The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science. Palindrome is a word which reads the same forward as it does backward. The longest common palindromic subsequence (LCPS) problem is a variant of the classic LCS problem which finds a longest common subsequence between two given strings such that the computed subsequence is also a palindrome. In this paper, we study the LCPS problem and give two novel algorithms to solve it. To the best of our knowledge, this is the first attempt to study and solve this problem.