- Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphsVamsi K Kundeti
Department of Computer Science and Engineering, University of Connecticut, 371 Fairfield Way, U 2155, Storrs, CT 06269, USA
BMC Bioinformatics 11:560. 2010..Here n is the size of the input and p is the number of processors. This algorithm enumerates all possible bi-directed edges which can overlap with a node and ends up generating Θ(nΣ) messages (Σ being the size of the alphabet)...
- PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problemHieu Dinh
Department of CSE, University of Connecticut, Storrs, CT 06269, USA
BMC Bioinformatics 12:410. 2011..They are helpful in finding transcriptional regulatory elements, transcription factor binding sites, and so on. As a result, the problem of identifying motifs is very crucial in biology...