Biomedical subjects

J Blazewicz

Publications and source records attributed to J Blazewicz.

3 recordsLinked to original sources

PubMed2004

An algorithm for an automatic NOE pathways analysis of 2D NMR spectra of RNA duplexes.

An algorithm is proposed to provide the tool for an automatic resonance assignment of 2D-NOESY spectra of RNA duplexes. The algorithm, based on a certain subproblem of the Hamiltonian path, reduces a number of possible connections between resonances within aromatic and anomeric region of 2D-NOESY spectra. Appropriate pathways between H6/H8 and H1' resonances were obtained by subsequent implementation of experimental data as limiting factors. Predictive power of the algorithm was tested on both experimental and simulated data for RNA and DNA duplexes.

Algorithms↗

PubMed1997

Sequential and parallel algorithms for DNA sequencing.

MOTIVATION: Reconstruction of the original DNA sequence in the sequencing by the hybridization approach (SBH) requires computational support due to a large number of possible combinations. One can notice a lack of algorithms admitting false-negative data and giving in addition all possible solutions. RESULTS: In this paper, a new method of sequencing has been proposed. An algorithm based on its idea (for the general case, when some data are missing, like in the real experiment) has been implemented and tested. Authentic DNA sequences have been used for testing. A parallel version of the algorithm has also been implemented and tested. The quality of the reconstruction is satisfactory for the library of oligonucleotides of length between 8 and 12, and 100, 200 and 300 bp long sequences. A way to a further decrease in the computation time is also suggested.

Algorithms↗

PubMed1997

Sequencing by Hybridization with Positive Faults.

The paper is concerned with a computational phase of the sequencing DNA chains by hybridization. It is assumed that positive faults can occur in the hybridization experiment. An approach based on a reduction of the problem to a variant of a Selective Traveling Salesman Problem and an algorithm for solving the latter, have been proposed. The algorithm behaves extremely well, even for a fault rate exceeding 50%.

Journal Article↗