A linear complexity phasing method for thousands of genomes

1.0k indexed citations

Abstract

loading...

About

This paper, published in 2011, received 1.0k indexed citations. Written by Olivier Delaneau, Jonathan Marchini and Jean‐François Zagury covering the research area of Genetics and Plant Science. It is primarily cited by scholars working on Genetics (646 citations), Molecular Biology (337 citations) and Cancer Research (89 citations). Published in Nature Methods.

Countries where authors are citing A linear complexity phasing method for thousands of genomes

Specialization
Citations

This map shows the geographic impact of A linear complexity phasing method for thousands of genomes. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by A linear complexity phasing method for thousands of genomes with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A linear complexity phasing method for thousands of genomes more than expected).

Fields of papers citing A linear complexity phasing method for thousands of genomes

Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of A linear complexity phasing method for thousands of genomes. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the A linear complexity phasing method for thousands of genomes.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

This paper is also available at doi.org/10.1038/nmeth.1785.

Explore hit-papers with similar magnitude of impact

Rankless by CCL
2026