FIMO: scanning for occurrences of a given motif
نویسندگان
چکیده
منابع مشابه
FIMO: scanning for occurrences of a given motif
UNLABELLED A motif is a short DNA or protein sequence that contributes to the biological function of the sequence in which it resides. Over the past several decades, many computational methods have been described for identifying, characterizing and searching with sequence motifs. Critical to nearly any motif-based sequence analysis pipeline is the ability to scan a sequence database for occurre...
متن کاملFIMO: Framework for Intrinsic Motivation
This paper aims to introduce a flexible framework called FIMO dedicated to intrinsic motivation in developmental robotics. With this framework we want to offer a common way of implementing, testing and analyzing mechanisms related to intrinsically motivated algorithms. It may be seen as a generic complex open source framework for online exploration and structuring of learning spaces. We hereby ...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Faster exact Markovian probability functions for motif occurrences: a DFA-only approach
BACKGROUND The computation of the statistical properties of motif occurrences has an obviously relevant application: patterns that are significantly over- or under-represented in genomes or proteins are interesting candidates for biological roles. However, the problem is computationally hard; as a result, virtually all the existing motif finders use fast but approximate scoring functions, in sp...
متن کاملNear-optimal algorithm to count occurrences of subsequences of a given length
For k ∈ ℤ+, define Σ k as the set of integers {0, 1, …, k - 1}. Given an integer n and a string t of length m ≥ n over Σ k , we count the number of times that each one of the kn distinct strings of length n over Σ k occurs as a subsequence of t. Our algorithm makes only one scan of t and solves the problem in time complexity mkn-1 and space complexity m + kn . These are very close to best possi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2011
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btr064