Abstract
We propose a heuristic algorithm, called ARG4WG, to build plausible ancestral recombination graphs (ARGs) from thousands of whole genome samples. By using the longest shared end for recombination inference, ARG4WG constructs ARGs with small numbers of recombination events that perform well in association mapping on genome-wide association studies.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE/ACM transactions on computational biology and bioinformatics
Paper Title
Journal
Date
