29 Questions 205 Answers 0 Followers
Questions related from William R. Buckley
I am researching random number generation techniques, and would like to find a neural network or other machine learning software, that is able to track the sequences that my software generates, in...
02 February 2019 2,230 2 View
Every Eulerian path constitutes a node in a graph. By what set of operators may these Eulerian paths be organised into a graph such that one may compute upon that graph all possible Hamiltonian...
04 April 2018 2,558 0 View
De Bruijn sequences are numbered by the equation dB(k,n) = ((k!)^(k^(n-1)))/(k^n). When we have dB(2,16), the computed value is of the order 2.1598E+9859 . For dB(16,4), the computed value is of...
01 January 2018 6,030 0 View
De Bruijn sequences are maximally disordered. Yet, they are computable. This implies that de Bruijn sequences retain yet a hint of order. Ordered objects like crystals have a regular structure...
10 October 2017 1,014 19 View
Generally, data compression is the act of removing redundancy (a lack of distinction, also know as repetition or order), and as de Bruijn sequences are maximally disordered, it must be the task of...
02 February 2017 9,196 4 View
I suspect that this is not known but it can be accomplished. Further, it matters not how large is the de Bruijn sequence; all of them can be so transformed, from one de Bruijn sequence into...
03 March 2016 3,279 2 View
The impending conversion of education, from the centralised academy model to the cottage model, including home schooling via MOOC, leads to the notion that RG and other similar media (like...
01 January 2016 2,605 0 View
There is much discussion on RG of collaboration mechanisms, utility of journals versus open publication on RG, and the role and validity of peer review. One may perhaps find a good number of...
11 November 2015 3,609 0 View
I seek a researcher who has such intimate knowledge of Haubold's algorithm, so as to guide my own research into this matter. All help is appreciated.
11 November 2015 1,534 4 View
Since maximal disorder in symbol sequences is computable, it is deterministic, one must conclude that random sources are rather biased - both away from disorder and toward some kind of bias. In...
02 February 2015 3,581 2 View
As indicated in other postings I've made, the sub-sequence has a length (number of symbols used to represent the indicated values [0..n)) that is equal to the rounded-up value of log10 n. So, for...
02 February 2015 5,394 44 View
My posts, regarding entropy, Shannon, Chaitin, Kolmogorov and Uniformly/Maximally Disordered Sequences have till now engaged a bit of dancing-round-the-fire. Given the development of my...
01 January 2015 8,671 1 View
I believe the question is complete. All that is required is the reply of a suitably disposed mathematician, and preferably a combinatorist.
01 January 2015 5,907 3 View
There are plenty of other reference materials posted in my questions and publications on ResearchGate. I think it is not enough for someone to claim that the sequences I've found are...
01 January 2015 9,423 2 View
A long-shot this question is, pertaining more generally to any informational structure (like a symbol sequence) and that such are, in and of themselves, interpretable in any number of ways, each...
11 November 2014 7,802 7 View
From my 2012 paper Computational Ontogeny comes this relevant quote: "Development is the acquisition of new features, be they physical or otherwise. For biological organisms, ontogeny is very...
08 August 2014 475 7 View
.
02 February 2014 6,101 3 View
This is the equation: f(n) = [ (4 ^ ( 4 ^ n)) * (3 ^ ( 4 ^ n)) * (2 ^ (4 ^ n)) * (1 ^ (4 ^ n)) ] / 4
02 February 2014 6,552 13 View
I have need of a mapping of transcripts (mRNA) versus the loci of their transcription (ORF, for instance). My interest is A. thaliana and when I visit TAIR much information is provided but I fail...
02 February 2014 8,791 7 View
The Q&A facility of ResearchGate is a great way for workers to find solutions to vexing problems, make contact with like minded researchers, etc. Yet, it seems a long way from the support that...
02 February 2014 5,165 2 View
The search for shortest unique substrings (shustrings) of the genome is an important problem, for in some sense it is the mix of these shustrings that defines the phenotype of an organism. A...
01 January 2014 5,658 6 View
This is to say, the linear ordering of nucleotide residues in the DNA molecule is equivalent to the orderings of nucleotide residues in the set of shustrings. I am looking for commentary on this...
01 January 2014 7,152 7 View
I have given thought to the software already described by myself in an earlier posting and it is easily modified to find such complementary sub-sequences. Hence, the question posed.
05 May 2013 7,610 6 View
The redundancy of nucleotide sequences can be measured to certainty, either in absolute terms or in relative times. For instance, for any DNA molecule of arbitrary length, it is certainly the...
03 March 2013 4,287 18 View
Extending the discussion of shustrings, it occurs to me that indeed this will perhaps be the best measure of sequence redundancy. If it happens that a genome of arbitrary size is of minimal...
03 March 2013 9,930 2 View
So, now I propose the topic of computational efficiency, particularly with regard to shustring search. A review of relevant literature mentions several concepts, each providing a portion to the...
03 March 2013 394 4 View
I think the question is clear.
01 January 1970 1,714 0 View
The question is obvious enough. The answers will be difficult. As we are with expectation a group of learned individuals, it should be easy enough to dispassionately address the question. So,...
01 January 1970 3,370 4 View
The issue is the un-scaffolding of Barr bodies. This is to ask, Is Barring of a chromosome reversible? If so, does it become expressed in meiosis?
01 January 1970 366 2 View
