@ARTICLE{Błazewicz_J._Graph_2008, author={Błazewicz, J. and Kasprzak, M.}, volume={vol. 56}, number={No 1}, journal={Bulletin of the Polish Academy of Sciences Technical Sciences}, pages={65-70}, howpublished={online}, year={2008}, abstract={The results presented here are twofold. First, a heuristic algorithm is proposed which, through removing some unnecessary arcs from a digraph, tends to reduce it into an adjoint and thus simplifies the search for a Hamiltonian cycle. Second, a heuristic algorithm for DNA sequence assembly is proposed, which uses a graph model of the problem instance, and incorporates two independent procedures of reducing the set of arcs - one of them being the former algorithm. Finally, results of tests of the assembly algorithm on parts of chromosome arm 2R of Drosophila melanogaster are presented.}, type={Artykuły / Articles}, title={Graph reduction and its application to DNA sequence assembly}, URL={http://sd.czasopisma.pan.pl/Content/110727/PDF-MASTER/(56-1)65.pdf}, keywords={directed graphs, adjoints, Hamiltonian cycle, reduction of arcs, DNA sequence assembly, heuristics}, }