A program for generating randomized simple and context-sensitive sequences

Behavior Research Methods

Volumn 40, Issue 2, 2008, Pages 484-492

  Remillard, Gilbert ^a  

^a MOREHEAD STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BEHAVIORAL SCIENCE; COMPUTER LANGUAGE; COMPUTER PROGRAM; METHODOLOGY; PROBABILITY; RANDOMIZATION;

ALGORITHMS; BEHAVIORAL SCIENCES; PROBABILITY; PROGRAMMING LANGUAGES; RANDOM ALLOCATION; RESEARCH DESIGN; SOFTWARE;

EID: 48149114905     PISSN: 1554351X     EISSN: None     Source Type: Journal    
DOI: 10.3758/BRM.40.2.484     Document Type: Article

References (15)

1. CASTELLAN, N. J., JR. (1992). Shuffling arrays: Appearances may be deceiving. Behavior Research Methods, Instruments, & Computers, 24, 72-77.
2. EMERSON, P. L., & TOBIAS, R. D. (1995). Computer program for quasi-random stimulus sequences with equal transition frequencies. Behavior Research Methods, Instruments, & Computers, 27, 88-98.
3. HUTCHINSON, J. P., & WILF, H. S. (1975). On Eulerian circuits and words with prescribed adjacency patterns. Journal of Combinatorial Theory A, 18, 80-87.
4. JIANG, M., ANDERSON, J., GILLESPIE, J., & MAYNE, M. (2007, June). uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts. Paper presented at the 2007 International Conference on Bioinforniatics and Computational Biology, Las Vegas.
5. JUNGNICKEL, D. (2005). Graphs, networks, and algorithms (2nd ed.). Berlin: Springer.
6. KANDEL, D., MATIAS, Y., UNGER, R., & WINKLER, P. (1996). Shuffling biological sequences. Discrete Applied Mathematics, 71, 171-185.
7. PROPP, J. G., & WILSON, D. B. (1998). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Journal of Algorithms, 27, 170-217.
8. REMILLARD, G. (2003). Pure perceptual-based sequence learning. Journal of Experimental Psychology: Learning, Memory, & Cognition, 29, 581-597.
9. REMILLARD, G. (2008). Implicit learning of second-, third-, and fourth-order adjacent and nonadjacent sequential dependencies. Quarterly Journal of Experimental Psychology, 61, 400-424.
10. REMILLARD, G., & CLARK, J. M. (1999). Generating fixed-length sequences satisfying any given nth-order transition probability matrix. Behavior Research Methods, Instruments, & Computers, 31, 235-243.
11. REMILLARD, G., & CLARK, J. M. (2001). Implicit learning of first-, second-, and third-order transition probabilities. Journal of Experimental Psychology: Learning, Memory, & Cognition, 27, 483-498.
12. ROBERTS, F. S. (1984). Applied combinatorics. Englewood Cliffs, NJ: Prentice Hall.
13. SCHVANEVELDT, R. W., & GOMEZ, R. L. (1998). Attention and probabilistic sequence learning. Psychological Research, 61, 175-190.
14. SOETENS, E., MELIS, A., & NOTEBAERT, W. (2004). Sequence learning and sequential effects. Psychological Research, 69, 124-137.
15. VAN CASTEREN, M., & DAVIS, M. H. (2006). Mix, a program for pseudo-randomization. Behavior Research Methods, 38, 584-589.