Efficient sequential and parallel algorithms for finding edit distance based motifs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2164
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Efficient sequential and parallel algorithms for finding edit distance based motifs ; volume:17 ; number:4 ; day:18 ; month:8 ; year:2016 ; pages:315-326 ; date:8.2016
BMC genomics ; 17, Heft 4 (18.8.2016), 315-326, 8.2016
- Urheber
-
Pal, Soumitra
- Beteiligte Personen und Organisationen
-
Xiao, Peng
Rajasekaran, Sanguthevar
SpringerLink (Online service)
- DOI
-
10.1186/s12864-016-2789-9
- URN
-
urn:nbn:de:1111-2016091510180
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:58 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
- Pal, Soumitra
- Xiao, Peng
- Rajasekaran, Sanguthevar
- SpringerLink (Online service)
Ähnliche Objekte (12)
Redefining the Graph Edit Distance
The Reeb Graph Edit Distance is Universal
Computing graph edit distance on quantum devices
Quantitative monitoring of STL with edit distance
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Secure approximation of edit distance on genomic data
Algorithms for finding RNA sequence-structure motifs
LSTM Networks for Edit Distance Calculation with Exchangeable Dictionaries
Lossless filter for multiple repeats with bounded edit distance
Redefining the Graph Edit Distance
The Reeb Graph Edit Distance is Universal
Computing graph edit distance on quantum devices
Quantitative monitoring of STL with edit distance
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Secure approximation of edit distance on genomic data
Algorithms for finding RNA sequence-structure motifs
LSTM Networks for Edit Distance Calculation with Exchangeable Dictionaries
Lossless filter for multiple repeats with bounded edit distance
Redefining the Graph Edit Distance
The Reeb Graph Edit Distance is Universal
Computing graph edit distance on quantum devices
Quantitative monitoring of STL with edit distance
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Secure approximation of edit distance on genomic data
Algorithms for finding RNA sequence-structure motifs
LSTM Networks for Edit Distance Calculation with Exchangeable Dictionaries