Science Current Events | Science News | Brightsurf.com
 
Email a Friend Send to a friend
Printer Friendly Print From biological imaging to Sudoku solutions

From biological imaging to Sudoku solutions

March 06, 2006

Cornell physicist Veit Elser has been engrossed recently in resolving a pivotal question in biological imaging. So he hasn't had much time for brainteasers and number games.

But in discovering an algorithm critical for X-ray diffraction microscopy, Elser and colleagues solved two problems. First, they gave researchers a new tool for imaging the tiniest and most delicate of biological specimens. And second, they discovered that the same algorithm also solves the internationally popular numbers puzzle Sudoku.




Not just one puzzle. All of them.

The Sudoku discovery appeals to Elser's whimsical side. But the algorithm, he notes, has potential for all kinds of other endeavors. "There are a lot of problems that you can represent in terms of this language," he says. "We're providing the technique. Whatever people use it for, it's great for us."

The so-called difference-map algorithm, which Elser says could have applications from productivity optimization to nanofabrication, tackles problems for which the solution must meet two independent constraints. In the case of Sudoku, the constraints are simple: Each of nine numbers, considered alone, appears nine times in the grid so that there is only one per row and column. And all nine numbers appear within each of the nine blocks.

In X-ray diffraction microscopy, the constraints are more complex. But the beauty of the algorithm, as Elser demonstrates, is that complexity doesn't matter. By applying the algorithm to the jumble of raw data from such an experiment, researchers can now reconstruct from it a clear, detailed image.

The result, shown in images published with a recent article in the Proceedings of the National Academy of Sciences (PNAS) with lead author David Shapiro of the State University of New York at Stony Brook and other colleagues, is a richly detailed image of a specimen as small as a single yeast cell - taken without staining, sectioning or otherwise damaging the specimen.

Unlike optical microscopes, which use a lens to focus light on a target (and are therefore only useful for specimens larger than the wavelength of visible light), imaging methods based on X-rays and electrons take advantage of the finer wavelengths provided by these forms of illumination.

But some of these methods can damage the specimen with harmful radiation, require that a specimen be stained or otherwise altered or lack the penetrating power necessary for three-dimensional reconstructions. X-ray diffraction microscopy, which uses "soft" X-rays and measures the resulting diffraction pattern, is often the method of choice because it gives a detail-rich image and leaves the specimen relatively unscathed.

The tricky part comes in using the diffraction pattern to reconstruct an image of the specimen. Instead of directly measuring the pixel-by-pixel contrast within the specimen, researchers are left with data that represents the object broken down into its constituent waves: a vast number of them, of different frequencies and amplitudes, waiting to be added up in a process called a Fourier synthesis to reconstruct the image.

"But if it were just combining waves with a definite oscillation and adding them up, that would be a piece of cake for a computer to do," says Elser.

The challenge is in the waves' phases, which are critical in reconstructing an image from the diffraction data. Without attention to that piece of the puzzle, the resulting image is reduced to noise.

"People used to say that's an impossible problem," Elser says. "Then people got to thinking about the fact that there are going to be constraints coming from some rather mundane facts - that in principle will make the problem of deducing the phase like the solution of a solvable puzzle."

The mundane fact, in this case, was a basic premise of the X-ray diffraction experiment: that the object in view have a clearly defined boundary (i.e., that all pixel values outside that boundary be set to zero).

"If I set up waves with known amplitudes and synthesize them, I'll find that for essentially all random combinations of phases, the thing I get is an object not confined," Elser says. "It takes a very clever combination of the phases of all those waves to add up to something in only one region; and cancel out everywhere else."

For the second constraint, the researchers required that the wave amplitudes used in the Fourier synthesis matched those measured by the experiment.

With the two constraints in place, the difference-map algorithm completes the job.

Cornell University News Service



Related Algorithm Current Events and Algorithm News Articles Algorithm Current Events and Algorithm News RSS Algorithm Current Events and Algorithm News RSS
Visual assistance for cosmic blind spots
A bit of imagination on the part of a measuring instrument wouldn't be a bad thing. It could help to add data from areas where the instrument is unable to measure.

Novel K-anonimity algorithm safeguards access to data
As electronic health records become more widely deployed, increasing amounts of health information are being collected. This data has many beneficial applications, such as research, public health, and health system planning.

Underground lines that bypass monuments
A team of mathematicians from the Engineering and Architecture Schools of the University of Seville has created a method to design underground lines whereby a city's historical buildings are unaffected.

A new computer simulator allows to design military strategies based on ants' movements
A researcher of the University of Granada has designed a new system for the mobility of military troops within a battlefield based on the mechanisms used by ant colonies to move using a commercial videogame.

When should flu trigger a school shutdown?
As flu season approaches, parents around the country are starting to face school closures. But how bad should an influenza outbreak be for a school to shut down?

Adapting Space-Industry Technology to Treat Breast Cancer
Researchers at Rush University Medical Center and Argonne National Laboratory are collaborating on a study to determine if an imaging technique used by NASA to inspect the space shuttle can be used to predict tissue damage often experienced by breast cancer patients undergoing radiation therapy.

LANL Roadrunner simulates nanoscale material failure
Very tiny wires, called nanowires, made from such metals as silver and gold, may play a crucial role as electrical or mechanical switches in the development of future-generation ultrasmall nanodevices.

Stanford study recommends change in treating pulmonary embolisms
William Kuo, MD, was the on-call interventional radiologist one Friday night three years ago when he received a call from the intensive care unit at Stanford Hospital & Clinics.

Scientists use world's fastest supercomputer to model origins of the unseen universe
Understanding dark energy is the number one issue in explaining the universe, according to Salman Habib, of the Laboratory's Nuclear and Particle Physics, Astrophysics and Cosmology group.

Concurrent imaging of metabolic and electric signals in the heart
Cardiac rhythm disorders can result from disturbances in cardiac metabolism. These metabolic changes are tightly linked with specific cardiac electrophysiology (CEP) abnormalities, such as depressed excitability, impaired intra- and extracellular conductivities, wave propagation block, and alteration of conduction velocity, action potential amplitude, and duration.
More Algorithm Current Events and Algorithm News Articles
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
by Thomas H. Cormen (Author), Charles E. Leiserson (Author), Ronald L. Rivest (Author), Clifford Stein (Author)

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the...

The Algorithm Design Manual

The Algorithm Design Manual
by Steven S. Skiena (Author)

This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new "war stories" and "interview problems", relating experiences from real-world...

Algorithms in a Nutshell (In a Nutshell (O'Reilly))

Algorithms in a Nutshell (In a Nutshell (O'Reilly))
by George T Heineman (Author), Gary Pollice (Author), Stanley Selkow (Author), Heineman George (Author), Pollice Gary (Author), Selkow Stanley (Author)

Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs -- with just enough math to let you understand and analyze algorithm performance.

With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate.

With this book, you will: Solve a particular coding...

Algorithms

Algorithms
by Sanjoy Dasgupta (Author), Christos Papadimitriou (Author), Umesh Vazirani (Author)

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal.

Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.

Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.

An accessible...

Introduction to the Design and Analysis of Algorithms (2nd Edition)

Introduction to the Design and Analysis of Algorithms (2nd Edition)
by Anany V. Levitin (Author)

Based on a Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, "Introduction to the Design and Analysis of Algorithms" presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.

Introduction to Algorithms

Introduction to Algorithms
by Thomas Cormen (Author), Charles Leiserson (Author), Ronald Rivest (Author), Clifford Stein (Author)

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.

In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased...

Algorithm Design

Algorithm Design
by Jon Kleinberg (Author), Éva Tardos (Author)

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.



Beginning Algorithms (Wrox Beginning Guides)

Beginning Algorithms (Wrox Beginning Guides)
by Simon Harris (Author), James Ross (Author)

Beginning Algorithms

A good understanding of algorithms, and the knowledge of when to apply them, is crucial to producing software that not only works correctly, but also performs efficiently. This is the only book to impart all this essential information-from the basics of algorithms, data structures, and performance characteristics to the specific algorithms used in development and programming tasks.

Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common...

Bundle of Algorithms in C++,  Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5)

Bundle of Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5)
by Robert Sedgewick (Author)

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C++. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C++, Third Edition, Parts 1-4 and his new Algorithms in C++, Third Edition, Part 5. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network...

Data Structures and Algorithms in Java (2nd Edition)

Data Structures and Algorithms in Java (2nd Edition)
by Robert Lafore (Author)

Data Structures and Algorithms in Java, Second Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate. In the second edition, the program is rewritten to improve operation and clarify the algorithms, the example programs are revised to work with the latest version of the Java JDK, and questions and exercises will be added at the end of each chapter making the book more useful to readers.



© 2009 BrightSurf.com