A parallel algorithm for DNA alignment

Royce, Thomas; Necaise, Rance D.

doi:10.1145/904073.904077

Search citation statements

Order By: Relevance

Paper Sections

Select...

Example2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2004

2010

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And by the (eqs. (10), (11), (12) and (13) Thus, according to the recovering of the optimal paths, the similarity of the two sequence will be in form:…”

Section: Examplementioning

confidence: 99%

See 1 more Smart Citation

A Binary Integer Programming model for computing DNA Sequence Alignment

Qubat¹

2010

AL-Rafidain Journal of Computer Sciences and Mathematics

View full text Add to dashboard Cite

DNA Sequence Alignment is an important problem in computational biology and is useful for comparing genomes and finding genes, for determining evolutionary linkage of different biological sequences. Dynamic Programming Problems is discussed and applied to solve this problem. This paper is concerned with computing DNA Sequence Alignment firstly by formulating a Binary Integer Programming model to compute the string sequence in Edit Distance Problem then re-formulating this model to be suitable to compute this alignment. By this model we gave a good role for Operations Researches field to prove it's efficient to solve problems of molecule of life. The suggested model is applied to solve an example in Edit Distance Problem then used again after re-formulating it for an example in DNA Sequence Alignment Problem.

show abstract

“…And by the (eqs. (10), (11), (12) and (13) Thus, according to the recovering of the optimal paths, the similarity of the two sequence will be in form:…”

Section: Examplementioning

confidence: 99%

“…All the paths of transformation the DNA sequences alignment AACTGGTACC to TTCACGGCA are optimal because they have the same number of gaps (five gaps) and the same length (12). See ([1] & [11]).…”

Section: Examplementioning

confidence: 99%