Skip to content
Book Bag:
0
items
(Full)
Login
Language
English
Slovak
Catalog
Catalog Books
Articles
Catalog ONDV
Catalog OND
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced
A COVER-MERGING-BASED ALGORITH...
Cite this
Print
Export Record
Export to MARC
Export to BibTeX
Export to Jednoduchý textový výpis
Export to ISBD (text)
Export to Citácia ISO 690 (HTML)
Export to Citácia ISO 690 (.doc)
Add to Book Bag
Remove from Book Bag
Permanent link
A COVER-MERGING-BASED ALGORITHM FOR THE LONGEST INCREASING SUBSEQUENCE IN A SLIDING WINDOW PROBLEM
Bibliographic Details
Main Author:
Deorowicz, Sebastian
(Author)
Format:
Article
Language:
Slovak
English
Pozri predplatné
Predplatné
Kliknite na „Pozri predplatné“.
Holdings
Description
Similar Items
Staff View
Similar Items
A hybrid algorithm for the longest common transposition-invariant subsequence problem
by: Deorowicz, Sebastian, et al.
CONSTRAINED LONGEST COMMON SUBSEQUENCE COMPUTING ALGORITHMS IN PRACTICE
by: Deorowicz, Sebastian, et al.
Systolic systems for the longest common subsequence problem
by: Andrejková, Gabriela, 1947-
An Online Algorithm of Finding Longest Periodic Subwords
by: Gu, Qiang, et al.
Merged
by: Henri, Maxine
Published: (2025)
