scholarly journals Computational Aspects of DNA Sequencing by Hybridization – a Survey

2018 ◽  
Vol 24 (4) ◽  
pp. 259-271
Author(s):  
Kamil Kwarciak ◽  
Marcin Radom ◽  
Piotr Formanowicz
Keyword(s):  
Dna Sequencing ◽  
Sequencing By Hybridization ◽  
Computational Aspects

COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH

1996 ◽  
Vol 07 (01) ◽  
pp. 87-93 ◽  
Author(s):  
ART M. DUVAL ◽  
W.F. SMYTH
Keyword(s):  
Positive Integer ◽  
Dna Sequencing ◽  
Oligonucleotide Probes ◽  
Minimum Cardinality ◽  
Sequencing By Hybridization ◽  
Fixed Length

A nonempty circular string C(x) of length n is said to be covered by a set Uk of strings each of fixed length k≤n iff every position in C(x) lies within an occurrence of some string u∈Uk. In this paper we consider the problem of determining the minimum cardinality of a set Uk which guarantees that every circular string C(x) of length n≥k can be covered. In particular, we show how, for any positive integer m, to choose the elements of Uk so that, for sufficiently large k, uk≈σk–m, where uk=|Uk| and σ is the size of the alphabet on which the strings are defined. The problem has application to DNA sequencing by hybridization using oligonucleotide probes.

Design of modified A*U and G*C base pairs with similar stability. Implication for the DNA sequencing by hybridization

1997 ◽  
Vol 38 (43) ◽  
pp. 7515-7518 ◽  
Author(s):  
Hong-Khanh Nguyen ◽  
Ulysse Asseline ◽  
Nguyen T. Thuong ◽  
Daniel Dupret
Keyword(s):  
Dna Sequencing ◽  
Base Pairs ◽  
Sequencing By Hybridization

Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries

2004 ◽  
Vol 28 (1) ◽  
pp. 11-19 ◽  
Author(s):  
Jacek Błażewicz ◽  
Piotr Formanowicz ◽  
Marta Kasprzak ◽  
Wojciech T. Markiewicz ◽  
Aleksandra Świercz
Keyword(s):  
Tabu Search ◽  
Dna Sequencing ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Sequencing By Hybridization
Sign in / Sign up

Export Citation Format

Share Document