All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

14 (0,125s)

Result

A New Biology: A Modern Perspective on the Challenge of Closing the Gap between the Islands of Knowledge

Main topics of the document: biological mathematics; biocomputation; interactions; events; mathematical models; computer simulation; dynamic computer graphics......

AE - Řízení, správa a administrativa

  • 2011
  • D
Result

Biocomputational prediction of small non-coding RNAs in Streptomyces

The first systematic study of small non-coding RNAs (sRNA, ncRNA) in Streptomyces is presented. Thirty-two potential sRNAs in Streptomyces were predicted. Of these, expression of 20 was detected by microarrays and RT-PCR. One predicted sRNA was ident...

IN - Informatika

  • 2008
  • Jx
Result

Aspects of shuffle and deletion on trajectories

modelling and recently in biocomputing area.

IN - Informatika

  • 2005
  • Jx
Result

Towards a robust biocomputing solution of combinatorial problems

An incremental approach to construction of biomolecular algorithms solving combinatorial problems is presented. The core idea is to build gradually the space of candidate solutions and remove invalid solutions as soon as possible. In this article, we...

IN - Informatika

  • 2007
  • D
Result

Towards a robust biocomputing solution of intractable problems

An incremental approach to construction of biomolecular algorithms solving intractable problems is presented. The core idea is to build gradually the space of candidate solutions and remove invalid solutions as soon as possible. We demonstrate two ex...

IN - Informatika

  • 2008
  • D
Result

On the scalability of biocomputing algorithms: The case of the maximum clique problem

The paper aims at demonstrating and confirming that breadth first search or pruning techniques can substantially improve the effectiveness of biomolecular algorithms. A breadth first search-based DNA algorithm solving the maximum clique problem for a...

IN - Informatika

  • 2011
  • Jx
  • Link
Result

D0L Systems + Watson-Crick complement = universal comutation

D0L systems consist of iterated letter-to-string morphism over a finite alphabet. Their descriptional power is rather limited and their length sequences can be expressed as sum of products of polynomial and exponential functions. Due to increasing in...

BD - Teorie informace

  • 2001
  • D
Result

Advances in Xmipp for Cryo–Electron Microscopy: From Xmipp to Scipion

Xmipp is an open-source software package consisting of multiple programs for processing data originating from electron microscopy and electron tomography, designed and managed by the Biocomputing Unit of the Spanish National Center for Biote...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2021
  • Jimp
  • Link
Result

The suboptimal structures find the optimal RNAs: homology search for bacterial non-coding RNAsusing suboptimal RNA structures

Non-coding RNAs (ncRNAs) are regulatory molecules encoded in the intergenic or intragenic regions of the genome. In prokaryotes, biocomputational identification of homologs of known ncRNAs in other species often fails due to weakly evolution...

EE - Mikrobiologie, virologie

  • 2011
  • Jx
Result

On hairpin-free words and languages

The paper examines the concept of hairpin-free words motivated from the biocomputing and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA computing and molecular genetics in general. A word is called ha...

IN - Informatika

  • 2005
  • D
  • 1 - 10 out of 14