Show document

A+ | A- | | SLO | ENG

Title: Efficient search algorithms for the restricted longest common subsequence problem Authors: ID Djukanović, Marko (Author) ID Kartelj, Aleksandar (Author) ID Eftimov, Tome, Institut "Jožef Stefan" (Author) ID Reixach, Jaume (Author) ID Blum, C. (Author) Files: PDF - Presentation file. (673,27 KB, This file will be accessible after 28.06.2025) MD5: 397C7C58AD31D4BECEAED3CA87ADAA1D   Language: English Typology: 1.08 - Published Scientific Conference Contribution Organization: IJS - Jožef Stefan Institute Publication status: Published Publication version: Author Accepted Manuscript Publication date: 28.06.2024 Publisher: Springer Nature Year of publishing: 2024 Number of pages: str. 58-73 Source: Švica PID: 20.500.12556/DiRROS-20991  UDC: 004 DOI: 10.1007/978-3-031-63775-9_5  COBISS.SI-ID: 207825923  Copyright: © 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG Publication date in DiRROS: 13.12.2024 Views: 72 Downloads: 0 Metadata:    Cite this work Plain text BibTeX EndNote XML EndNote/Refer RIS ABNT ACM Ref AMA APA Chicago 17th Author-Date Harvard IEEE ISO 690 MLA Vancouver : Copy citation

Share: Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a monograph

Title:	Computational Science – ICCS 2024 : 24th International Conference, Malaga, Spain, July 2–4, 2024, Proceedings, Part V
Editors:	Leonardo Franco
Publisher:	Springer Cham
Year of publishing:	2024
ISBN:	978-3-031-63775-9
COBISS.SI-ID:	207819523
Collection title:	Lecture notes in computer science
Collection ISSN:	0302-9743

Document is financed by a project

Funder:	Other - Other funder or multiple funders
Funding programme:	BI-BA/24-25-006

Secondary language

Language:	Slovenian
Keywords:	računalništvo, internet, algoritmi

Back