Blog articles tagged 'bioinformatics'

0
comment
on 2/13/2017 10:41 AM
The post on applying GPU to finding Eulerian path mentioned a stumbling block: partitioning a very specific kind of graph. In general, partitioning is a hard problem, NP-hard actually. The graphs we are dealing with are very specific, though, and may be p[...]
.
0
comment
on 12/26/2016 9:07 PM
So, continuing where we left off: Walking the Euler Path: Intro Visualizing Graphs Walking the Euler Path: GPU for the Road Walking the Euler Path: PIN Cracking and DNA Sequencing For the Win And finally I ran the GPU-enabled algorithm for finding the Eul[...]
.
0
comment
on 11/8/2016 10:22 PM
Continuing on to some cool applications of Eulerian paths. Intro Visualization GPU/CUDA Injection The goal of this little graph experiment remains exploration of accelerating Eulerian path finding on the GPU. This is the final introductory post. Eulerian [...]
.
0
comment
on 9/25/2016 7:43 PM
Continuation of the previous posts: Intro Visualization GPU Digression I was going to talk about something else this week but figured I’d take advantage of the free-hand format and digress a bit. Continuing the travel metaphor and remembering Julius Cesar[...]
.
0
comment
on 9/17/2016 2:38 PM
Source Code I’m thinking about a few posts in these series going very fast through the project. The source is on my GitHub, check out the tags since the master branch is still work in progress. Experimenting with Graph Algorithms with F# and GPU Graphs pl[...]
.
0
comment
on 9/8/2015 6:41 PM
I love GPU programming for precisely this: it forces and enables you to think about a solution in a non-linear fashion in more than one sense of the word. The Problem Given a set , output a set In other words, pretend our array is cyclical, and we want al[...]
.
0
comment
on 9/6/2015 3:55 PM
The Problem This is a problem for which no polynomial time solution exists, although a pseudo-polynomial (polynomial in the degree of the maximum element) does exist. In this paper, the algorithm proposed for the sum-function with full information is simp[...]
.
0
comment
on 8/20/2015 1:33 PM
As my former boss and mentor used to say, in order to understand recursion one must first understand recursion. This is funny, ha-ha, but if we tweak it slightly we get a really useful statement: in order to understand dynamic programming, one must first [...]
.
0
comment
on 5/17/2015 3:22 PM
The Problem “Motif finding is a problem of finding common substrings of specified length in a set of strings. In bioinformatics, this is useful for finding transcription binding sites” (recap here). The problem is succinctly stated on Rosalind. Given a se[...]
.
IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us
Built with WebSharper