Logo image
Efficient algorithms for counting and reporting segregating sites in genomic sequences
Journal article   Peer reviewed

Efficient algorithms for counting and reporting segregating sites in genomic sequences

M. Christodoulakis, G.B. Golding, C.S. Iliopoulos, Y.J.P. Ardila and W.F. Smyth
Journal of Computational Biology, Vol.14(7), pp.1001-1010
2007
url
Link to Published Version *Subscription may be requiredView

Abstract

The number of segregating sites provides an indicator of the degree of DNA sequence variation that is present in a sample, and has been of great interest to the biological, pharmaceutical and medical professions. In this paper, we first provide linear- and expected-sublinear-time algorithms for finding all the segregating sites of a given set of DNA sequences. We also describe a data structure for tracking segregating sites in a set of sequences, such that every time the set is updated with the insertion of a new sequence or removal of an existing one, the segregating sites are updated accordingly without the need to re-scan the entire set of sequences.

Details

UN Sustainable Development Goals (SDGs)

This output has contributed to the advancement of the following goals:

#3 Good Health and Well-Being

Source: InCites

Metrics

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
Domestic collaboration
International collaboration
Citation topics
1 Clinical & Life Sciences
1.189 Genome Studies
1.189.310 Population Genetics
Web Of Science research areas
Biochemical Research Methods
Biotechnology & Applied Microbiology
Computer Science, Interdisciplinary Applications
Mathematical & Computational Biology
Statistics & Probability
ESI research areas
Biology & Biochemistry
Logo image