Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Computational Aspects of DNA Sequencing by Hybridization : a Survey
EN
Sequencing by hybridization (SBH) is a method of reading DNA sequence from its smaller fragments. Such a method has been proposed in late 1980s and until the emergence of the new generation sequencing it has been widely used and improved. Since the initial, classical approach to SBH, many modifications and enhancements was proposed, aimed at improving the preciseness and the length of sequences which can be unambiguously read. Even now, for some DNA sequences sequencing by hybridization can still be used effectively and at a low cost. In this paper many different approaches to the SBH will be described, mainly from the points of view of algorithms and computational complexity.
EN
In this paper a greedy algorithm for some variants of the sequencing by hybridization method is presented. In the standard version of the method information about repetitions is not available. In the paper it is assumed that a partial information of this type is a part of the problem instance. Here two simple but realistic models of this information are taken into consideration. The first one assumes it is known if a given element of a spectrum appears in the target sequence once or more than once. The second model uses the knowledge is a given element of a spectrum occurs in the analyzed sequence once, twice or at least three times. The proposed greedy algorithm solves the variant of the problem with positive and negative errors. Results of a computational experiment are reported which, among others, confirm that the additional information leads to the improvement of the obtained solutions. They also show that the more precise model of information increases the quality of reconstructed sequences.
PL
W pracy przedstawiony jest algorytm typu podziału i ograniczeń dla problemu sekwencjonowania przez hybrydyzację z błędami negatywnymi oraz częściową informacją o powtórzeniach. Uwzględnienie tego rodzaju informacji możliwe jest ze względu na rozwój technologii stosowanej w eksperymencie hybrydyzacyjnym. Prowadzi ono do rozszerzenia standardowej wersji metody sekwencjonowania przez hybrydyzację oraz do polepszenia jakości uzyskiwanych rozwiązań.
EN
In this paper a branch and bound algorithm for sequencing by hybridization problem with negative errors and partial information about repetitions is presented. Taking into account information of this type is possible because of the development of the technology used in the hybridization experiment. It leads to an extension of the standard sequencing by hybridization method and to an improvement of the quality of the obtained results.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.