Two Binary Linear Programming Models for Haplotype Assembly Problem in Triploid Case

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.

ETEMADI M.; BAGHERIAN M.; VAZIRI H.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2021 | Volume:18 | Issue:3 (70) Page(s): 1-13

Download Full-Text

Persian Verion

View:

226

Download:

Cites:

Information Journal Paper

Title

Two Binary Linear Programming Models for Haplotype Assembly Problem in Triploid Case

Author(s)

ETEMADI M. | BAGHERIAN M. | VAZIRI H.R. | Issue Writer Certificate

Keywords

Haplotype Assembly

Binary Linear Programming

Triploid

Exact Methods

Abstract

The Haplotype Assembly problem aims at finding originate haplotypes of some fragments that obtained from sequencing methods. In diploid case in which organisms have pair chromosomes, like humans, the aim is to reconstruct two haplotypes such that each of reads is originated from one of the two reconstructed haplotypes. In diploid case, the problem is well studied and since it is NP-hard due to unavoidable errors of sequencing machines, exact approaches are of exponential order. So, many fast, but approximate approaches have been proposed. In Triploid case, the aim is finding three haplotypes such that each read originates from one of the three haplotypes. The Triploid case is much harder than the diploid case and faces with more computational difficulties. For this reason, a few researchers studied the Triploid case of Haplotype Assembly problem. In this paper, two Binary Linear Programming models are proposed for two cases of availability and non-availability of genotype data for Triploid Haplotype Assembly and the computational efficiency of the models is tested on simulated datasets using AIMMS. The proposed models could be generalized to higher ploidy.

Cites

No record.

References

No record.

Cite

APA: Copy

ETEMADI, M., BAGHERIAN, M., & VAZIRI, H.R.. (2021). Two Binary Linear Programming Models for Haplotype Assembly Problem in Triploid Case. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 18(3 (70) ), 1-13. SID. https://sid.ir/paper/953900/en

Vancouver: Copy

ETEMADI M., BAGHERIAN M., VAZIRI H.R.. Two Binary Linear Programming Models for Haplotype Assembly Problem in Triploid Case. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2021;18(3 (70) ):1-13. Available from: https://sid.ir/paper/953900/en

IEEE: Copy

M. ETEMADI, M. BAGHERIAN, and H.R. VAZIRI, “Two Binary Linear Programming Models for Haplotype Assembly Problem in Triploid Case,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 18, no. 3 (70) , pp. 1–13, 2021, [Online]. Available: https://sid.ir/paper/953900/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops