ArticlePloS one2023
A new gene tree algorithm employing DNA sequences of bovine genome using discrete Fourier transformation.
Article in PloS one, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed, 0 citations in OpenAlex.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors at 2 institutions in 1 country.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Within the realms of human thoughts on nature, Fourier analysis is considered as one of the greatest ideas currently put forwarded. The Fourier transform shows that any periodic function can be rewritten as the sum of sinusoidal functions. Having a Fourier transform view on real-world problems like the DNA sequence of genes, would make things intuitively simple to understand in comparison with their initial formal domain view. In this study we used discrete Fourier transform (DFT) on DNA sequences of a set of genes in the bovine genome known to govern milk production, in order to develop a new gene clustering algorithm. The implementation of this algorithm is very user-friendly and requires only simple routine mathematical operations. By transforming the configuration of gene sequences into frequency domain, we sought to elucidate important features and reveal hidden gene properties. This is biologically appealing since no information is lost via this transformation and we are therefore not reducing the number of degrees of freedom. The results from different clustering methods were integrated using evidence accumulation algorithms to provide in insilico validation of our results. We propose using candidate gene sequences accompanied by other genes of biologically unknown function. These will then be assigned some degree of relevant annotation by using our proposed algorithm. Current knowledge in biological gene clustering investigation is also lacking, and so DFT-based methods will help shine a light on use of these algorithms for biological insight.
Indexed as
Identifiers
What Socratic holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.