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 set of strings DNA of size t, find “most common” substrings of length k. “Most common” means, that substrings […]
>> Read the full article on viralfsharp.com
.
IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us | Terms of Use | Privacy Policy | Cookie Policy
Built with WebSharper