Features Archives - Volume 8

Featured Story
Figure 1. A sample traveling salesman problem involving the shortest path connecting all cities. Arrows indicate the direction that someone can travel. For example, a voyager can leave Atlanta and arrive in St. Louis, and vice versa.

Fear Not Traveling Salesmen, DNA Computing is Here to Save the Day

By Srivastava Siddharth

Introduction

In 1994, Leonard M. Adleman, a professor at the University of Southern California, created a storm of excitement in the computing world when he announced that he had solved a famous computation problem. There was nothing remarkable about the problem itself, which dealt with finding the shortest route through a series of points. Nor was there anything special about how long it took Adleman to solve it — seven days — substantially greater than the few m ...More »
Other articles in this volume:
Issue 1
Risks of smallpox vaccination give cause for concern Risks of smallpox vaccination give cause for concern

Issue 2
Fear Not Traveling Salesmen, DNA Computing is Here to Save the Day Fear Not Traveling Salesmen, DNA Computing is Here to Save the Day

Issue 3
Florida Manatees: On the Brink of Extinction Florida Manatees: On the Brink of Extinction

JYI is supported by: The National Science Foundation, The Burroughs Wellcome Fund, Glaxo Wellcome Inc., Science Magazine, Science's Next Wave, Swarthmore College, Duke University, Georgetown University, and many others.
Copyright ©1998-2009 The Journal of Young Investigators, Inc.