- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem ; volume:12 ; number:1 ; day:24 ; month:10 ; year:2011 ; pages:1-10 ; date:12.2011
BMC bioinformatics ; 12, Heft 1 (24.10.2011), 1-10, 12.2011
- Creator
-
Dinh, Hieu
- Contributor
-
Rajasekaran, Sanguthevar
Kundeti, Vamsi K.
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-12-410
- URN
-
urn:nbn:de:1111-2016021728206
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 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
- Dinh, Hieu
- Rajasekaran, Sanguthevar
- Kundeti, Vamsi K.
- SpringerLink (Online service)
Other Objects (12)
QuateXelero : an accelerated exact network motif detection algorithm
Efficient motif finding algorithms for large-alphabet inputs
A fast weak motif-finding algorithm based on community detection in graphs
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization
Finding maximal exact matches in graphs
A survey of DNA motif finding algorithms
Algorithms and statistical methods for exact motif discovery
RecMotif: a novel fast algorithm for weak motif discovery
ExactSearch: a web-based plant motif search tool
Sequence motif finder using memetic algorithm
Direct vs 2-stage approaches to structured motif finding
Fast and exact quantification of motif occurrences in biological sequences
QuateXelero : an accelerated exact network motif detection algorithm
Efficient motif finding algorithms for large-alphabet inputs
A fast weak motif-finding algorithm based on community detection in graphs
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization
Finding maximal exact matches in graphs
A survey of DNA motif finding algorithms
Algorithms and statistical methods for exact motif discovery
RecMotif: a novel fast algorithm for weak motif discovery
ExactSearch: a web-based plant motif search tool
Sequence motif finder using memetic algorithm
Direct vs 2-stage approaches to structured motif finding
Fast and exact quantification of motif occurrences in biological sequences
QuateXelero : an accelerated exact network motif detection algorithm
Efficient motif finding algorithms for large-alphabet inputs
A fast weak motif-finding algorithm based on community detection in graphs
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization
Finding maximal exact matches in graphs
A survey of DNA motif finding algorithms
Algorithms and statistical methods for exact motif discovery
RecMotif: a novel fast algorithm for weak motif discovery
ExactSearch: a web-based plant motif search tool
Sequence motif finder using memetic algorithm
Direct vs 2-stage approaches to structured motif finding