Modeling of Partial Digest Problem as a Network flows problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NADIMI R.; RANJBAR O.

Educational Videos and Scientific Workshops

Scientific Information Database

ISSN: 2588-4824

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2019 | Volume:5 | Issue:20 Page(s): 63-70

Download Full-Text

Persian Verion

View:

407

Download:

Cites:

Information Journal Paper

Title

Modeling of Partial Digest Problem as a Network flows problem

Author(s)

NADIMI R. | RANJBAR O. | Issue Writer Certificate

Keywords

Restriction site mappingQ1

Network flowsQ1

Partial digest problemQ1

Abstract

Restriction site mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the Restriction site mapping is to determine the location of every site for a given enzyme. In partial digest method, all pairwise distances between restriction sites are produced. Mathematically, given pairwise distances between n points on a line segment, the goal is to find that points. This problem has been named Partial digest problem(PDP). In this paper we present a new model for PDP using generalized Network flows. Since complexity class of this problem is one of the most important open problems in bioinformatics (there is no polynomial algorithm and no proof for Np-completeness) reducing to a network flow problem create a new viewpoint to challenge with this problem.

Cites

No record.

References

No record.

Cite

APA: Copy

NADIMI, R., & RANJBAR, O.. (2019). Modeling of Partial Digest Problem as a Network flows problem. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 5(20 ), 63-70. SID. https://sid.ir/paper/257349/en

Vancouver: Copy

NADIMI R., RANJBAR O.. Modeling of Partial Digest Problem as a Network flows problem. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2019;5(20 ):63-70. Available from: https://sid.ir/paper/257349/en

IEEE: Copy

R. NADIMI, and O. RANJBAR, “Modeling of Partial Digest Problem as a Network flows problem,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 5, no. 20 , pp. 63–70, 2019, [Online]. Available: https://sid.ir/paper/257349/en

Related Journal Papers

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops

Download

Move to top

وبگردی