DNA Based Computers II
Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > DNA Based Computers II: (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)
DNA Based Computers II: (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)

DNA Based Computers II: (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

The fledgling field of DNA computers began in 1994 when Leonard Adleman surprised the scientific community by using DNA molecules, protein enzymes, and chemicals to solve an instance of a hard computational problem. This volume presents results from the second annual meeting on DNA computers held at Princeton only one and one-half years after Adleman's discovery. By drawing on the analogy between DNA computing and cutting-edge fields of biology (such as directed evolution), this volume highlights some of the exciting progress in the field and builds a strong foundation for the theory of molecular computation. DNA computing is a radically different approach to computing that brings together computer science and molecular biology in a way that is wholly distinct from other disciplines. This book outlines important advances in the field and offers comprehensive discussion on potential pitfalls and the general practicality of building DNA based computers.

Table of Contents:
A sticker based model for DNA computation by S. Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, M. F. Goodman, P. W. K. Rothemund, and L. M. Adleman On applying molecular computation to the data encryption standard by L. M. Adleman, P. W. K. Rothemund, S. Roweis, and E. Winfree Massively parallel DNA computation: Expansion of symbolic determinants by T. H. Leete, M. D. Schwartz, R. M. Williams, D. H. Wood, J. S. Salem, and H. Rubin Universal DNA computing models based on the splicing operation by G. Paun Running dynamic programming algorithms on a DNA computer by E. B. Baum and D. Boneh A molecular computation of the road coloring problem by N. Jonoska and S. A. Karl DNA based molecular computation: Template-template interactions in PCR by P. D. Kaplan, G. Cecchi, and A. Libchaber Use of a horizontal chain reaction for DNA-based addition by F. Guarnieri and C. Bancroft Computation with DNA: Matrix multiplication by J. S. Oliver A surface-based approach to DNA computation by Q. Liu, Z. Guo, Z. Fei, A. E. Condon, R. M. Com, M. G. Lagally, and L. M. Smith Mesoscopic computer engineering: Automating DNA-based molecular computing via traditional practices of parallel computer architecture design by J.-T. Amenyo Error-resistant implementation of DNA computations by M. Amos, A. Gibbons, and D. Hodgson Making DNA computers error resistant by D. Boneh, C. Dunworth, R. J. Lipton, and J. Sgall Active transport in biological computing by S. A. Kurtz, S. R. Mahaney, J. S. Royer, and J. Simon RNA based computing: Some examples from RNA catalysis and RNA editing by L. F. Landweber Universal computation via self-assembly of DNA: Some theory and experiments by E. Winfree, X. Yang, and N. C. Seeman The perils of polynucleotides: The experimental gap between the design and assembly of unusual DNA structures by N. C. Seeman, H. Wang, B. Liu, J. Qi, X. Li, X. Yang, F. Liu, W. Sun, Z. Shen, R. Sha, C. Mao, Y. Wang, S. Zhang, T.-J. Fu, S. Du, J. E. Mueller, Y. Zhang, and J. Chen DNA sequences useful for computation by E. B. Baum A restricted genetic alphabet for DNA computing by K. U. Mir Good encodings for DNA-based solutions to combinatorial problems by R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, and S. E. Stevens, Jr. DNA computations can have global memory by R. J. Lipton Exascale computer algebra problems interconnect with molecular reactions and complexity theory by R. M. Williams and D. H. Wood.


Best Sellers


Product Details
  • ISBN-13: 9780821807569
  • Publisher: American Mathematical Society
  • Publisher Imprint: American Mathematical Society
  • Language: English
  • Series Title: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
  • ISBN-10: 0821807560
  • Publisher Date: 01 Apr 1999
  • Binding: Hardback
  • No of Pages: 275
  • Weight: 709 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
DNA Based Computers II: (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)
American Mathematical Society -
DNA Based Computers II: (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

DNA Based Computers II: (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!