Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/5147
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRay, Shubhra Sankar-
dc.contributor.authorBandyopadhyay, Sanghamitra-
dc.contributor.authorPal, Sankar K-
dc.date.accessioned2013-01-16T12:20:13Z-
dc.date.available2013-01-16T12:20:13Z-
dc.date.issued2005-
dc.identifier.citationFirst International Conference, PReMI 2005, Lecture Notes in Computer Science, v. 3776, p. 617-622en_US
dc.identifier.urihttp://hdl.handle.net/10263/5147-
dc.language.isoenen_US
dc.subjectTraveling salesman problemen_US
dc.subjectGene orderingen_US
dc.subjectMicroarray dataen_US
dc.subjectNearest fragment operatoren_US
dc.subjectCrossover operatoren_US
dc.titleNew genetic operators for solving TSP: application to microarray gene orderingen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
LNICS-3776-2005-p 617-622.pdf323.67 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.