New genetic operators for solving TSP: application to microarray gene ordering
| dc.contributor.author | Ray, Shubhra Sankar | |
| dc.contributor.author | Bandyopadhyay, Sanghamitra | |
| dc.contributor.author | Pal, Sankar K | |
| dc.date.accessioned | 2013-01-16T12:20:13Z | |
| dc.date.available | 2013-01-16T12:20:13Z | |
| dc.date.issued | 2005 | |
| dc.identifier.citation | First International Conference, PReMI 2005, Lecture Notes in Computer Science, v. 3776, p. 617-622 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/5147 | |
| dc.language.iso | en | en_US |
| dc.subject | Traveling salesman problem | en_US |
| dc.subject | Gene ordering | en_US |
| dc.subject | Microarray data | en_US |
| dc.subject | Nearest fragment operator | en_US |
| dc.subject | Crossover operator | en_US |
| dc.title | New genetic operators for solving TSP: application to microarray gene ordering | en_US |
| dc.type | Article | en_US |
