A hybrid method for the exact planted (l, d) motif finding problem and its parallelization
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization ; volume:13 ; number:17 ; day:13 ; month:12 ; year:2012 ; pages:1-12 ; date:12.2012
BMC bioinformatics ; 13, Heft 17 (13.12.2012), 1-12, 12.2012
- Creator
-
Abbas, Mostafa M.
- Contributor
-
Abouelhoda, Mohamed
Bahig, Hazem M.
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-13-S17-S10
- URN
-
urn:nbn:de:1111-2016021736919
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:22 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
- Abbas, Mostafa M.
- Abouelhoda, Mohamed
- Bahig, Hazem M.
- SpringerLink (Online service)
Other Objects (12)
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
Efficient sequential and parallel algorithms for planted motif search
Finding maximal exact matches in graphs
RefSelect: a reference sequence selection algorithm for planted (l, d) motif search
A survey of DNA motif finding algorithms
Algorithms and statistical methods for exact motif discovery
Efficient motif finding algorithms for large-alphabet inputs
ExactSearch: a web-based plant motif search tool
QuateXelero : an accelerated exact network motif detection algorithm
Direct vs 2-stage approaches to structured motif finding
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets
Fast and exact quantification of motif occurrences in biological sequences
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
Efficient sequential and parallel algorithms for planted motif search
Finding maximal exact matches in graphs
RefSelect: a reference sequence selection algorithm for planted (l, d) motif search
A survey of DNA motif finding algorithms
Algorithms and statistical methods for exact motif discovery
Efficient motif finding algorithms for large-alphabet inputs
ExactSearch: a web-based plant motif search tool
QuateXelero : an accelerated exact network motif detection algorithm
Direct vs 2-stage approaches to structured motif finding
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets
Fast and exact quantification of motif occurrences in biological sequences
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
Efficient sequential and parallel algorithms for planted motif search
Finding maximal exact matches in graphs
RefSelect: a reference sequence selection algorithm for planted (l, d) motif search
A survey of DNA motif finding algorithms
Algorithms and statistical methods for exact motif discovery
Efficient motif finding algorithms for large-alphabet inputs
ExactSearch: a web-based plant motif search tool
QuateXelero : an accelerated exact network motif detection algorithm
Direct vs 2-stage approaches to structured motif finding
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets