For Libraries For Publication Open Access Downloads About Us Contact Us
Paper Titles
A Mathematical Model for Aerobic BAC System to Treating of Drinking Water
p.535
A New Algorithm of Fast-Generated Panoramic Images
p.539
A Note on "Implicit Mann Fixed Point Iterations for Pseudo-Contractive Mappings"
p.543
A Pilot Study on Footwear Biomechanical Effect to Diabetic Patients
p.546
A Practical Heuristic Algorithm for the Minimum Founder Set Reconstructive Problem
p.549
A Study on the Mooring-Line Force Characteristics of Composite-Type Sea Cage
p.555
A Two-Step Resolution for Preparing Enantiopure (S)-Ethyl Nipecotate
p.559
Activity Changes of Several Enzymes during Pepper (Piper nigrum L.) Decortication by Fermentation Using Bacillus subtilis CICC10076 and Natural Water Retting
p.567
Amphetamine-Induced Locomotion and Brain Stimulation Reward Research and Applications
p.572

A Practical Heuristic Algorithm for the Minimum Founder Set Reconstructive Problem

Article Preview

Abstract:

It has been generally accepted that current-day population evolved from a small number of specific sequences called founders, and the genomic sequences (called recombinants) of individuals within the population are composed of segments from the founders due to recombination. In this paper, the minimum founder set problem is studied. A practical heuristic algorithm HMFS is presented for solving the problem, which partitions the sites of founders into three parts and reconstructs them respectively. Experimental results show that HMFS can solve the minimum founder set problem fast and effectively. Furthermore, when the number of recombinants and SNP sites grows large, HMFS is still able to find satisfied solution to this problem very quickly. Hence it is practical in realistic applications

You might also be interested in these eBooks
Biotechnology, Chemical and Materials Engineering View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 393-395)

Pages:

549-554

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.393-395.549

Citation:

Cite this paper

Online since:

November 2011

Authors:

Jing Li Wu

Keywords:

Algorithm (GA), Founder, Minimum Founder Set Problem, Recombinant

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

References

[1] J.D. Kececioglu, D. Gusfield: Discrete Applied Mathematics Vol. 88 (1998), p.239.

Google Scholar

[2] R. Schwartz, A.G. Clark, S. Istrail: LNCS 2983 (Springer-Verlag Publications, Berlin 2002).

Google Scholar

[3] E. Ukkonen: LNCS 2452(Springer-Verlag Publications, London 2002).

Google Scholar

[4] P. Rastas, E. Ukkonen: LNCS 4645 (Springer-Verlag Publications, Berlin 2007).

Google Scholar

[5] Y. Wu, D. Gusfield: LNCS 6129 (Springer-Verlag Publications, Berlin 2007).

Google Scholar

[6] G. Blin, R. Rizzi, F. Sikora, S. Vialette: Proceedings of the 17th Computing: the Australasian Theory Symposium(CRPIT Publications, Perth 2011).

Google Scholar

[7] Q. Zhang, W. Wang, L. McMillan, J. Prins, F.P. -M. de Villena, D. Threadgill: LNCS 5251 (Springer-Verlag Publications, Berlin 2008).

Google Scholar

[8] A. Roli, C. Blum: LNCS 5518(Springer-Verlag Publications, Berlin 2009).

Google Scholar

[9] M. Kreitman: Nature Vol. 304 (1983), p.412.

Google Scholar

[10] T.I.H. Consortium: Nature Vol. 426 (2003), p.789.

Google Scholar

© 2025 Trans Tech Publications Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For open access content, terms of the Creative Commons licensing CC-BY are applied.
Scientific.Net is a registered trademark of Trans Tech Publications Ltd.