Using bioinformatics to analyse germplasm collections

Euphytica

Volumn 137, Issue 1, 2004, Pages 39-54

  Davenport, Guy ^a   Ellis, Noel ^a   Ambrose, Mike ^a   Dicks, Jo ^a  

^a NORWICH RESEARCH PARK   (United Kingdom)

Author keywords

bioinformatics; computational biology; data mining; data visualisation; genetic diversity; germplasm collections

Indexed keywords

EID: 4544293204     PISSN: 00142336     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:EUPH.0000040501.06112.ca     Document Type: Article

References (17)

1. Blanchette, M., T. Kunisawa & D. Sankoff, 1996. Parametric genome rearrangement. Gene-Combis 172: 11-17.
2. Cerny, V., 1985. Thermodynamical approach to the travelling salesman problem - an efficient simulation algorithm. J Optim Theor Applic 45 (1): 41-51.
3. Clark, P.C. & T.N. Niblett, 1989. The CN2 Induction Algorithm. Machine Learning 3 (4): 261-283.
4. Debuse, J.C.W., B. de la Iglesia, C.M. Howard & V.J. Rayward-Smith, 2001. Building the KDD Roadmap: A Methodology for Knowledge Discovery. Industrial Knowledge Management, pp. 179-196. R. R., Springer-Verlag.
5. Flavell A.J., M.R. Knox, S.R. Pearce & T.H.N. Ellis, 1998. Retrotransposon-based insertion polymorphisms (RBIP) for high throughput marker analysis. Plant J 16 (5): 643-650.
6. Freitas, A.A., 1998. A genetic algorithm for generalized rule induction. In: 3rd On-Line World Conference on Soft Computing in Engineering Design and Manufacturing, Hosted on the Internet.
7. Goldberg, D.E., 1985. Alleles, loci and the travelling salesman problem. An International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum Associates, Hillsdate, NJ.
8. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
9. de la Iglesia, B., J.C.W. Debuse & V.J. Rayward-Smith, 1996. Discovering knowledge in commercial databases using modern heuristic techniques. In: Second International Conference On Knowledge Discovery and Data Mining. AAAI Press, Menlo Park, CA.
10. Jaccard, P., 1908 Nouvelles recherches sur la distribution florale. Bull Soc Vaud Sci Nat 44: 223-270.
11. Kirkpatrick, S., C.D. Gelatt & M.P. Vecchi, 1983. Optimization by Simulated Annealing. Science 220 (4598): 671-680.
12. Michalski, R.S., 1969. On the quasi-minimal solution of the general covering problem. In: 5th International Symposium on Information Processing. Bled, Yugoslavia.
13. Mitchell, T., 1997. Machine Learning. McGraw-Hill Education (ISE Editions).
14. Pearce S.R., M. Knox, T.H.N. Ellis, A.J. Flavell & A. Kumar, 2000. Pea Ty1-copia group retrotransposons: transpositional activity and use as markers to study genetic diversity in Pisum. Mol Gen Genet 263 (6): 898-907.
15. Quinlan, J.R., 1986. Induction of decision trees. Machine Learning 1 (1): 81-106.
16. Quinlan, J.R., 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA.
17. Quinlan, J.R., 1997. Successor to c4.5. Knowledge Discov Nuggets 97 (9), http://www.kdnuggets.com/news/97/n09.html.