662 research outputs found
Sort by
No full textPoznańThe computer resources needed to run the TB LMTO code have been reduced using a genetic algorithm in computations of the total energy requiring the interactive user-dependent mode. A computer program has been developed to search for the total energy minima and perform calculations in the background. The number of runs and output files is determined by the size of population and not by the number of scans of the configuration space
Wykorzystanie statystyk dLibry w tworzeniu biblioteki cyfrowej - doświadczenia Biblioteki Cyfrowej Politechniki Łódzkiej eBiPol
Get PDF
No full textPoznańIn classical DNA sequencing by hybridization it is assumed that the information obtained in the biochemical stage of the method is a set of the l-tuples composing the target sequence. It means that the information concerning the number of the repeated l-tuples is not available. Such an assumption was justified by the DNA chip technology constraints. However, nowadays some approximate information about l-tuple multiplicities can be obtained in the experiments, where DNA chips are used. It was a motivation for formulating combinatorial problems which arise when such additional information is taken into account. The goal of this paper is to formulate and classify these problems, what should establish a good starting point for further research concerning algorithmic methods solving DNA sequencing problems with multiplicity information. Moreover, the computational complexity of the new problems is determined, which in most cases is analogous to the complexity of their classical counterpart