Naoki Katoh's Books

Chemistry and Biology of Non-canonical Nucleic Acids

By: Naoki Sugimoto

Write a review Read reviews Take a Quiz Solve Book Puzzle

Chemistry and Biology of Non-canonical Nucleic Acids

By: Naoki Sugimoto

Discover the fundamentals and intricacies of a subject at the interface of chemistry and biology with this authoritative resource Chemistry and Biology of Non-canonical Nucleic Acids delivers a comprehensive treatment of the chemistry and biology of non-canonical nucleic acids, including their history, structures, stabilities, properties, and functions. You'll learn about the role of these vital compounds in transcription, translation, regulation, telomeres, helicases, cancers, neurodegenerative diseases, therapeutic applications, nanotechnology, and more. An ideal resource for graduate students, researchers in physical, organic, analytical, and inorganic chemistry will learn about uncommon nucleic acids, become the common non-canonical nucleic acids that fascinate and engage academics and professionals in private industry. Split into 15 chapters covering a wide range of aspects of non-canonical nucleic acids, the book explains why these compounds exist at the forefront of a new research revolution at the intersection of chemistry and biology. Chemistry and Biology of Non-canonical Nucleic Acids also covers a broad range of topics critical to understanding these versatile and omnipresent chemicals, including: * A discussion of the dynamic regulation of biosystems by nucleic acids with non-canonical structures * The role played by nucleic acid structures in neurodegenerative diseases and various cancers * An exploration of the future outlook for the chemistry and biology of non-canonical nucleic acids * An introduction to the history of canonical and non-canonical structures of nucleic acids * An analysis of the physicochemical properties of non-canonical nucleic acids Perfect for biochemists, materials scientists, and bioengineers, Chemistry and Biology of Non-canonical Nucleic Acids will also earn a place in the libraries of medicinal and pharmaceutical chemists who wish to improve their understanding of life processes and the role that non-canonical nucleic acids play in them.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

288

Publisher

John Wiley & Sons

Published Date

ISBN 10

3527345213

ISBN 13

9783527345212

Algorithms and Computation

14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings

By: Toshihide Ibaraki,Naoki Katoh,Hirotaka Ono

Write a review Read reviews Take a Quiz Solve Book Puzzle

Algorithms and Computation

14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings

By: Toshihide Ibaraki,Naoki Katoh,Hirotaka Ono

This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

764

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540206957

ISBN 13

9783540206958

A Linear-time Algorithm for Testing Outer-1-planarity

By: Seok-Hee Hong,Peter Eades,Naoki Katoh,Giuseppe Liotta,Pascal Schweitzer,Yusuke Suzuki

Write a review Read reviews Take a Quiz Solve Book Puzzle

A Linear-time Algorithm for Testing Outer-1-planarity

By: Seok-Hee Hong,Peter Eades,Naoki Katoh,Giuseppe Liotta,Pascal Schweitzer,Yusuke Suzuki

A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. A graph is outer-1-planar if it has an embedding in which every vertex is on the outer face and each edge has at most one crossing. We present a linear time algorithm to test whether a graph is outer-1-planar. The algorithm can be used to produce an outer-1-planar embedding in linear time if it exists.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Published Date

ISBN 10

1742103200

ISBN 13

9781742103204

Book's by Naoki Katoh

Chemistry and Biology of Non-canonical Nucleic Acids

Chemistry and Biology of Non-canonical Nucleic Acids

Algorithms and Computation

Algorithms and Computation

A Linear-time Algorithm for Testing Outer-1-planarity

A Linear-time Algorithm for Testing Outer-1-planarity

Username

Password

Username

Password

Password again

Birthday

Email