An approach for identification of unknown viruses using sequencing-by-hybridization

2015 ◽  
Vol 87 (9) ◽  
pp. 1616-1624 ◽  
Author(s):  
Sarah E. Katoski ◽  
Hermann Meyer ◽  
Sofi Ibrahim
DNA Arrays ◽  
2003 ◽  
pp. 39-51 ◽  
Author(s):  
Radoje Drmanac ◽  
Snezana Drmanac

1996 ◽  
Vol 07 (01) ◽  
pp. 87-93 ◽  
Author(s):  
ART M. DUVAL ◽  
W.F. SMYTH

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.


2017 ◽  
Vol 9 (5) ◽  
pp. 698-704
Author(s):  
Yubai Guo ◽  
Yu Song ◽  
Jun Luo ◽  
Zhiqiang Pan ◽  
Cui Yin ◽  
...  

2005 ◽  
Vol 29 (1) ◽  
pp. 69-77 ◽  
Author(s):  
Jacek Błażewicz ◽  
Piotr Formanowicz

Sign in / Sign up

Export Citation Format

Share Document