
 [No title] (Site not responding. Last check: 20071022) 
  When analyzing complex chiasms, it is wise to run the program for large numbers r of random rearrangements only after estimating the time required, by running the program for fewer random rearrangements, such as r = 10000. 
  Boyd F. Edwards, bedwards@wvu.edu, 13 April 2003 Chiasm: 1 Number n of chiastic elements: 2 Number of appearances of each chiastic element: 2,2 Number m of nonchiastic elements: 0 This chiasm is simple. 
  (yes/no): y Chiasm: 4 Number n of chiastic elements: 9 Number of appearances of each chiastic element: 6,8,6,3,5,7,9,3,5 Number m of nonchiastic elements: 2 Number of appearances of each nonchiastic element: 2,3 Number r of rearrangements: 10000 Number of duplicate levels (normally 0): 0 Calculating... 
 www.as.wvu.edu /phys/readme.txt (922 words) 
