2014
DOI: 10.1016/j.cor.2014.01.007
|View full text |Cite
|
Sign up to set email alerts
|

Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…In our algorithm, we assume no knowledge about the number of times when different fragments hybridized with the same probe. There are articles dealing with such a problem, for example [ 16 18 ], but in our approach, we consider negative errors from repetitions as missing data.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In our algorithm, we assume no knowledge about the number of times when different fragments hybridized with the same probe. There are articles dealing with such a problem, for example [ 16 18 ], but in our approach, we consider negative errors from repetitions as missing data.…”
Section: Methodsmentioning
confidence: 99%
“…In the most recent paper concerning SBH method, an approach has been presented based on the limited knowledge how many times an oligonucleotide from the probe is present in the target DNA, i.e., once or more. Knowing that simple fact can greatly improve the method, as shown in [ 16 18 ].…”
Section: Introductionmentioning
confidence: 99%
“…The performance of the greedy algorithm encouraged its authors to implement a more sophisticated heuristic. A tabu and scatter search algorithm has been proposed [28]. It solves the problem with any kind of hybridization errors and is able to take into account the multiplicity information models "one and many" and "one, two and many".…”
Section: 3 Tabu Search Algorithmmentioning
confidence: 99%
“…The next comparison utilized 59 real DNA sequences of length 509bp with natural repetitions only. The number of optimally solved instances for a hybrid genetic algorithm [18], the old tabu and scatter search algorithm [19] and for the new tabu and scatter search [28] were respectively: 26, 52 and 59 (the last one solved all instances optimally).…”
Section: 3 Tabu Search Algorithmmentioning
confidence: 99%
“…In the literature, TS heuristic has been applied to several problems including machine and production scheduling problems (Bilgin and Azizoğlu, ; Pitts and Ventura, ), vehicle routing problem (Barbarosoğlu and Özgür, ; Jin et al., ), production–distribution and inventory routing problems (Shiguemoto and Armentano, ), capacitated clustering problem (França et al., ), corridor allocation problem (Ahonen et al., ), and DNA sequencing (Kwarciak and Formanowicz, ).…”
Section: Literature Reviewmentioning
confidence: 99%