Efficient sequential and parallel algorithms for finding edit distance based motifs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2164
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Pal, Soumitra
- Contributor
-
Xiao, Peng
Rajasekaran, Sanguthevar
SpringerLink (Online service)
- DOI
-
10.1186/s12864-016-2789-9
- URN
-
urn:nbn:de:1111-2016091510180
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Pal, Soumitra
- Xiao, Peng
- Rajasekaran, Sanguthevar
- SpringerLink (Online service)
Other Objects (12)
Redefining the Graph Edit Distance
The Reeb Graph Edit Distance is Universal
Quantitative monitoring of STL with edit distance
Computing graph edit distance on quantum devices
Embedding edit distance to enable private keyword search
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Secure approximation of edit distance on genomic data
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
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
Quantitative monitoring of STL with edit distance
Computing graph edit distance on quantum devices
Embedding edit distance to enable private keyword search
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Secure approximation of edit distance on genomic data
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
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
Quantitative monitoring of STL with edit distance
Computing graph edit distance on quantum devices
Embedding edit distance to enable private keyword search
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Secure approximation of edit distance on genomic data
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Algorithms for finding RNA sequence-structure motifs
LSTM Networks for Edit Distance Calculation with Exchangeable Dictionaries