Publisher Correction: Longest Common Substring with Approximately k Mismatches
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
Publisher Correction: Longest Common Substring with Approximately k Mismatches ; day:10 ; month:4 ; year:2023 ; pages:1
Algorithmica ; (10.4.2023), 1
- Klassifikation
-
Recht
- Urheber
-
Kociumaka, Tomasz
Radoszewski, Jakub
Starikovskaya, Tatiana
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01119-x
- URN
-
urn:nbn:de:101:1-2023090209203642111200
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kociumaka, Tomasz
- Radoszewski, Jakub
- Starikovskaya, Tatiana
- SpringerLink (Online service)
Ähnliche Objekte (12)
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Dynamic and Internal Longest Common Substring
Publisher Correction: Publisher correction for multiple articles
Acceleration of sequence clustering using longest common subsequence filtering
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Correction of scaling mismatches in oligonucleotide microarray data
Mapping biological entities using the longest approximately common prefix method
The longest journey
Publisher Correction: Thermodiffusive desalination
Publisher Correction: Nanomechanical characterization
Publisher Correction: Epistemological justification
Women: the longest revolution
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Dynamic and Internal Longest Common Substring
Publisher Correction: Publisher correction for multiple articles
Acceleration of sequence clustering using longest common subsequence filtering
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Correction of scaling mismatches in oligonucleotide microarray data
Mapping biological entities using the longest approximately common prefix method
The longest journey
Publisher Correction: Thermodiffusive desalination
Publisher Correction: Nanomechanical characterization
Publisher Correction: Epistemological justification
Women: the longest revolution
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Dynamic and Internal Longest Common Substring
Publisher Correction: Publisher correction for multiple articles
Acceleration of sequence clustering using longest common subsequence filtering
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Correction of scaling mismatches in oligonucleotide microarray data
Mapping biological entities using the longest approximately common prefix method
The longest journey
Publisher Correction: Thermodiffusive desalination
Publisher Correction: Nanomechanical characterization
Publisher Correction: Epistemological justification