Relevant bibliographies by topics / Structured programming / Journal articles
To see the other types of publications on this topic, follow the link: Structured programming.

Journal articles on the topic 'Structured programming'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Structured programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Perez, M. M. "Structured programming." Advances in Engineering Software 14, no. 2 (January 1992): 168–69. http://dx.doi.org/10.1016/0965-9978(92)90070-v.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Müller, Bernd. "Is object-oriented programming structured programming?" ACM SIGPLAN Notices 28, no. 9 (September 1993): 57–66. http://dx.doi.org/10.1145/165364.165385.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Harris, Philip J. "Computer analysis of structures — matrix structural analysis structured programming." Canadian Journal of Civil Engineering 14, no. 6 (December 1, 1987): 860–61. http://dx.doi.org/10.1139/l87-128.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Harris, Philip J. "Computer analysis of structures — matrix structural analysis structured programming." Canadian Journal of Civil Engineering 14, no. 6 (December 1, 1987): 863. http://dx.doi.org/10.1139/l87-131.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kilov, H. "Structured system programming." Proceedings of the IEEE 73, no. 12 (1985): 1865. http://dx.doi.org/10.1109/proc.1985.13383.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sermeno, Jason. "Graphical Block Structured Programming: A Visual Programming Paradigm." Journal of Innovative Technology Convergence 1, no. 1 (June 30, 2019): 51–58. http://dx.doi.org/10.69478/jitc2019v1n1a06.

Full text
Abstract:
This paper discusses the concept and design of a graphical block-structured programming paradigm that presents a model for constructing computer programs using a set of graphical objects that resembles the existing lexical instructions in a C language. The design of the paradigm was motivated by the results from studies investigating the previous designs and the acquisition of existing visual programming languages. Studies showed that most people are having trouble expressing the structures that they cannot write or verbally describe due to their limited grasp of natural language. The aim of this proposed programming paradigm is to improve the user’s ability to create programs by making programming more accessible to some particular audience and improving the correctness and speed with which people perform programming tasks.
APA, Harvard, Vancouver, ISO, and other styles
7

Rapin, Charles. "Block structured object programming." ACM SIGPLAN Notices 32, no. 4 (April 15, 1997): 47–54. http://dx.doi.org/10.1145/254459.254472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gibbons, Jeremy. "Structured programming in Java." ACM SIGPLAN Notices 33, no. 4 (April 1998): 40–43. http://dx.doi.org/10.1145/278283.278289.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bennett, Harold, and Derald Walling. "Once Again, Structured Programming:." Computers in the Schools 2, no. 2-3 (July 31, 1985): 171–78. http://dx.doi.org/10.1300/j025v02n02_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tran, Con, and Pierre N. Robillard. "Teaching structured assembler programming." ACM SIGCSE Bulletin 17, no. 4 (December 1985): 32–44. http://dx.doi.org/10.1145/989369.989374.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Lewinski, A. "Structured programming using Pascal." Information and Software Technology 32, no. 8 (October 1990): 573. http://dx.doi.org/10.1016/0950-5849(90)90154-j.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Chlipala, Adam. "The bedrock structured programming system." ACM SIGPLAN Notices 48, no. 9 (November 12, 2013): 391–402. http://dx.doi.org/10.1145/2544174.2500592.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Mills, H. D. "Structured Programming: Retrospect and Prospect." IEEE Software 3, no. 6 (November 1986): 58–66. http://dx.doi.org/10.1109/ms.1986.229478.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Roberts, Eric S. "Loop exits and structured programming." ACM SIGCSE Bulletin 27, no. 1 (March 15, 1995): 268–72. http://dx.doi.org/10.1145/199691.199815.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Meissner, Loren P., Elliott P. Organick, and Lawrence Ruby. "FORTRAN 77: Featuring Structured Programming." American Journal of Physics 53, no. 9 (September 1985): 924. http://dx.doi.org/10.1119/1.14380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Anderson, Ronald, Harold Bennett, and Derald Walling. "Structured Programming Constructs in BASIC:." Computers in the Schools 4, no. 2 (December 1987): 135–40. http://dx.doi.org/10.1300/j025v04n02_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Oliveira, Bruno C. d. S., and William R. Cook. "Functional programming with structured graphs." ACM SIGPLAN Notices 47, no. 9 (October 15, 2012): 77–88. http://dx.doi.org/10.1145/2398856.2364541.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

van Otterlo, Martijn. "Intensional dynamic programming. A Rosetta stone for structured dynamic programming." Journal of Algorithms 64, no. 4 (October 2009): 169–91. http://dx.doi.org/10.1016/j.jalgor.2009.04.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Johann, Patricia, and Neil Ghani. "Foundations for structured programming with GADTs." ACM SIGPLAN Notices 43, no. 1 (January 14, 2008): 297–308. http://dx.doi.org/10.1145/1328897.1328475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Ross, John Minor, and Huazhong Zhang. "Structured programmers learning object-oriented programming." ACM SIGCHI Bulletin 29, no. 4 (October 1997): 93–99. http://dx.doi.org/10.1145/270950.270999.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Jonsson, Dan. "Pancode and boxcharts: structured programming revisited." ACM SIGPLAN Notices 22, no. 8 (August 1987): 89–98. http://dx.doi.org/10.1145/35596.35605.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Danelutto, M. "Irregularity handling via structured parallel programming." International Journal of Computational Science and Engineering 1, no. 2/3/4 (2005): 73. http://dx.doi.org/10.1504/ijcse.2005.009693.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Bugliesi, Michele, Evelina Lamma, and Paola Mello. "Partial deduction for structured logic programming." Journal of Logic Programming 16, no. 1-2 (May 1993): 89–122. http://dx.doi.org/10.1016/0743-1066(93)90024-b.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Wilson, LB. "Structured programming: PL/I with PLC." Information and Software Technology 30, no. 10 (December 1988): 617. http://dx.doi.org/10.1016/0950-5849(88)90118-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Filar, J. A., and T. A. Schultz. "Bilinear programming and structured stochastic games." Journal of Optimization Theory and Applications 53, no. 1 (April 1987): 85–104. http://dx.doi.org/10.1007/bf00938818.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Er, M. "Structured programming techniques: A study of relative complexity—Some programming considerations." Computers & Education 20, no. 4 (June 1993): 311–14. http://dx.doi.org/10.1016/0360-1315(93)90005-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Aken, L. Van, and H. Van Brussel. "A structured geometric database in an off-line robot programming system." Robotica 5, no. 4 (October 1987): 333–39. http://dx.doi.org/10.1017/s0263574700016362.

Full text
Abstract:
SUMMARYThis work describes a hierarchically structured geometric database in an off-line robot programming system. The data structure contains the numerical definition of the frame variables, as well as an indicator of the respective reference frames. Moreover, the physical relations between the objects in the environment are included. The database is implemented such that it continuously reflects the actual structure of the environment. As a result, all calculations of the frame locations are carried out automatically. Moreover, the programming system is capable to autonomously updating the numerical information after changes in the environment. Making this database the heart of a robot programming system greatly simplifies the off-line programming of complex robot tasks, like f.i. assembly tasks.
APA, Harvard, Vancouver, ISO, and other styles
28

Kunakorn-ong, Pathawee, Kitchanon Ruangjirakit, Pattaramon Jongpradist, Sontipee Aimmanee, and Yossapong Laoonual. "Design and optimization of electric bus monocoque structure consisting of composite materials." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 234, no. 20 (April 15, 2020): 4069–86. http://dx.doi.org/10.1177/0954406220917690.

Full text
Abstract:
This paper proposes a novel design methodology for electric-bus structures by implementing the finite element method via ABAQUS™ and linear programming via MATLAB™. A monocoque sandwich-structured fiber-reinforced composite bus with a maximum driving range of 300 km is conceived using the proposed methodology. The bus-body structure is designed based on safety criteria such as vehicle registration regulations, the strength of the bus structure under various driving conditions, bending- and torsion-stiffness requirements, and the rollover testing standard of UN ECE R66. A procedure developed to systematically conduct parametric studies by varying the core and face thicknesses of the sandwich structure of each component is presented. Multivariate functions are formulated to determine the correlations of structural responses with changes in geometric parameters. Linear programming is implemented to minimize the mass of the bus structure under design constraints. The proposed monocoque bus structure meets all requirements, and its body mass is 63.3% less than the benchmark value.
APA, Harvard, Vancouver, ISO, and other styles
29

Shindo, Hikaru, Masaaki Nishino, and Akihiro Yamamoto. "Differentiable Inductive Logic Programming for Structured Examples." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 6 (May 18, 2021): 5034–41. http://dx.doi.org/10.1609/aaai.v35i6.16637.

Full text
Abstract:
The differentiable implementation of logic yields a seamless combination of symbolic reasoning and deep neural networks. Recent research, which has developed a differentiable framework to learn logic programs from examples, can even acquire reasonable solutions from noisy datasets. However, this framework severely limits expressions for solutions, e.g., no function symbols are allowed, and the shapes of clauses are fixed. As a result, the framework cannot deal with structured examples. Therefore we propose a new framework to learn logic programs from noisy and structured examples, including the following contributions. First, we propose an adaptive clause search method by looking through structured space, which is defined by the generality of the clauses, to yield an efficient search space for differentiable solvers. Second, we propose for ground atoms an enumeration algorithm, which determines a necessary and sufficient set of ground atoms to perform differentiable inference functions. Finally, we propose a new method to compose logic programs softly, enabling the system to deal with complex programs consisting of several clauses. Our experiments show that our new framework can learn logic programs from noisy and structured examples, such as sequences or trees. Our framework can be scaled to deal with complex programs that consist of several clauses with function symbols.
APA, Harvard, Vancouver, ISO, and other styles
30

Westrom, Marv. "Teaching Structured Programming in the Secondary Schools." Journal of Research on Computing in Education 25, no. 2 (December 1992): 274–76. http://dx.doi.org/10.1080/08886504.1992.10782050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Carbone, Marco, Kohei Honda, and Nobuko Yoshida. "Structured Communication-Centered Programming for Web Services." ACM Transactions on Programming Languages and Systems 34, no. 2 (June 2012): 1–78. http://dx.doi.org/10.1145/2220365.2220367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Parasyuk, I. N., A. I. Provotar, and I. A. Zalozhenkova. "A methodology of structured-modular composition programming." Cybernetics and Systems Analysis 31, no. 1 (January 1995): 123–30. http://dx.doi.org/10.1007/bf02366803.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Flaherty, Terry. "A simple technique to motivate structured programming." ACM SIGCSE Bulletin 20, no. 1 (February 1988): 153–55. http://dx.doi.org/10.1145/52965.53002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Khan, E. H., M. Al-A'ali, and M. R. Girgis. "Object-oriented programming for structured procedural programmers." Computer 28, no. 10 (1995): 48–57. http://dx.doi.org/10.1109/2.467579.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

MacKenzie, S. "A structured approach to assembly language programming." IEEE Transactions on Education 31, no. 2 (May 1988): 123–28. http://dx.doi.org/10.1109/13.2296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Er, MC. "Termination-indicator technique as structured programming tool." Information and Software Technology 31, no. 10 (December 1989): 529–34. http://dx.doi.org/10.1016/0950-5849(89)90174-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Fenton, N. E., R. W. Whitty, and A. A. Kaposi. "A generalised mathematical theory of structured programming." Theoretical Computer Science 36 (1985): 145–71. http://dx.doi.org/10.1016/0304-3975(85)90040-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Saxe, Suzanne. "Adapting structured programming techniques to instructional design." Performance + Instruction 24, no. 1 (February 1985): 5–8. http://dx.doi.org/10.1002/pfi.4150240103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Donner, Klaus. "Data structures and dynamic programming background for editing highly structured texts." Annals of Operations Research 16, no. 1 (December 1988): 267–80. http://dx.doi.org/10.1007/bf02283748.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Xue, Dan, Wenyu Sun, and Hongjin He. "A structured trust region method for nonconvex programming with separable structure." Numerical Algebra, Control & Optimization 3, no. 2 (2013): 283–93. http://dx.doi.org/10.3934/naco.2013.3.283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Morsy, T., J. Götze, and H. Nassar. "Convex programming for detection in structured communication problems." Advances in Radio Science 8 (December 22, 2010): 307–12. http://dx.doi.org/10.5194/ars-8-307-2010.

Full text
Abstract:
Abstract. The generalized Minimum Mean Squared Error (GMMSE) detector has a bit error rate performance, which is similar to the MMSE detector. The advantage of the GMMSE detector is that it does not require the knowledge of the noise power. However, the computational complexity of the GMMSE detector is significantly higher than the computational complexity of the MMSE detector. In this paper, the complexity of the GMMSE detector is reduced by taking into account the structure of the system matrix (Toeplitz). Furthermore, by using circular approximation of the structured system matrix an approximate GMMSE detector is presented, whose computational complexity is only slightly higher than MMSE, i.e.~only an iterative gradient descent algorithm based on the inversion of diagonal matrices is additionally required.
APA, Harvard, Vancouver, ISO, and other styles
42

Larsson, Andreas. "Reading the Code Between the Lines." Nordic Studies in Science Education 18, no. 3 (November 30, 2022): 305–22. http://dx.doi.org/10.5617/nordina.8774.

Full text
Abstract:
Recent work in computer science education shows that natural language plays a pivotal role in learners’ understanding of programming concepts. This study explores metaphorical expressions in four computer programming textbooks and online resources in Swedish upper secondary education. The Metaphor Identification Procedure was applied to identify metaphoric language. The metaphors reveal how expressions such as the ‘program asking’ or the ‘function building’ are structured in relation to embodied experiences. The results show that central concepts are structured in relation to metaphors such as Inanimate Phenomena are Human Agents and Organisation is Physical Structure. Findings also demonstrate differences in the types of metaphors are present in each resource, with Events are Actions communicated most frequently. Lastly, the resources vary in how they describe the role of the programmer: as a ‘constructor’ or ‘instructor’. This implies that the discovered metaphoric structure in textual resources might influence students’ subsequent learning of programming concepts.
APA, Harvard, Vancouver, ISO, and other styles
43

Täckström, Oscar, Kuzman Ganchev, and Dipanjan Das. "Efficient Inference and Structured Learning for Semantic Role Labeling." Transactions of the Association for Computational Linguistics 3 (December 2015): 29–41. http://dx.doi.org/10.1162/tacl_a_00120.

Full text
Abstract:
We present a dynamic programming algorithm for efficient constrained inference in semantic role labeling. The algorithm tractably captures a majority of the structural constraints examined by prior work in this area, which has resorted to either approximate methods or off-the-shelf integer linear programming solvers. In addition, it allows training a globally-normalized log-linear model with respect to constrained conditional likelihood. We show that the dynamic program is several times faster than an off-the-shelf integer linear programming solver, while reaching the same solution. Furthermore, we show that our structured model results in significant improvements over its local counterpart, achieving state-of-the-art results on both PropBank- and FrameNet-annotated corpora.
APA, Harvard, Vancouver, ISO, and other styles
44

SELINGER, PETER. "Towards a quantum programming language." Mathematical Structures in Computer Science 14, no. 4 (August 2004): 527–86. http://dx.doi.org/10.1017/s0960129504004256.

Full text
Abstract:
We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.
APA, Harvard, Vancouver, ISO, and other styles
45

Kuz, Antonieta. "Computational thinking: an analysis through structured programming using Scratch." Revista de Ciencia y Tecnología, no. 39 (May 1, 2023): 82–90. http://dx.doi.org/10.36995/j.recyt.2023.39.010.

Full text
Abstract:
In recent years, numerous initiatives have emerged to develop computational thinking. Computational thinking and programming are closely related they are both tools for working with algorithmic concepts. ICTs and, and specifically computer programs with a playful orientation for teaching programming are relevant since they take into consideration aspects related to the educational environment. Game-based learning is a complement that allows taking advantage of the playful component of games to train computational thinking and, therefore, various others skills. Scratch is one of the most used tools to teach programming, through visual and playful programming languages that seek to promote computational skills that involve problem solving, through active and constructive learning. In this study, theoretical foundations of structured programming are analyzed based on simple computing concepts such as handling sequences, control instructions such as loops and conditionals, and their adaptation using Scratch. For this article, a qualitative analysis is presented, supported by descriptive research. The partial findings, at this point, suggest the usefulness of applying video games to train computational thinking skills. In this way, opens the possibility of proposing extended uses of other interactive games such as Lightbot, PilasEngine, Pilas Bloques.
APA, Harvard, Vancouver, ISO, and other styles
46

Ladias, Anastasios, Theodoros Karvounidis, and Dimitrios Ladias. "Classification of the programming styles in scratch using the SOLO taxonomy." Advances in Mobile Learning Educational Research 1, no. 2 (2021): 114–23. http://dx.doi.org/10.25082/amler.2021.02.006.

Full text
Abstract:
The present study attempts to categorize the programming styles of sequential, parallel, and event-driven programming using as criterion, the level of adoption of the structured programming design techniques. These techniques are modularity, hierarchical design, shared code, and parametrization. Applying these techniques to the Scratch programming environment results in a two-dimensional table of representative code. In this table, one dimension is the types of the aforementioned programming styles and the other is the characteristics of structured programming. The calibration of each of the dimensions has been held with the help of the levels of the SOLO taxonomy. This table can develop criteria for evaluating the quality characteristics of codes produced by students in a broader grading system.
APA, Harvard, Vancouver, ISO, and other styles
47

Harahap, Eva Darwisah, and Zulaiha Siregar. "Kelebihan dan Kelemahan dalam Penggunaan Object Oriented Programming." Jurnal Ilmiah Universitas Batanghari Jambi 23, no. 2 (July 26, 2023): 1206. http://dx.doi.org/10.33087/jiubj.v23i2.3189.

Full text
Abstract:
In general, many programming languages have been provided for making applications, both of small and large value, which are useful for answering various other user needs. Object-oriented programming is an object-oriented programming paradigm, all data and functions contained in it are wrapped in classes or object objects. , compared to structured programming logic where each object can receive messages, process data, and also send messages to other objects, object-oriented programs were discovered in the 1960s there starting from a structured program creation and then this method was developed from C and Pascal.
APA, Harvard, Vancouver, ISO, and other styles
48

Groce, Alex. "Passages." ACM SIGSOFT Software Engineering Notes 46, no. 4 (October 27, 2021): 7. http://dx.doi.org/10.1145/3485952.3485953.

Full text
Abstract:
O.-J. Dahl, E. W. Dijkstra, and C. A. R. Hoare's Structured Programming is a foundational text in software engineering, programming languages, and computer science, although perhaps now a seldom-read one. This column will focus primarily on Dijkstra's part of the book, the first 80 or so pages, his famous Notes on Structured Programming. I'll also comment briefly on Dahl and Hoare's contributions, which are well worth your time.
APA, Harvard, Vancouver, ISO, and other styles
49

García Torres, Ingrid, Angel Plaza Vargas, and Harry Zurita Hurtado. "ICT in Structured Programming Learning through Constructivist Techniques for Education." Journal of Science and Research: Revista Ciencia e Investigación 3, CITT2017 (February 22, 2018): 69–71. http://dx.doi.org/10.26910/issn.2528-8083vol3isscitt2017.2018pp69-71.

Full text
Abstract:
There are some things for university students that are important to acquire the whole learning of a particular subject moreover when the subject is one of the last ones that a student must take in order to finish the university requirements to be a professional, at the moment the student has a wide range of knowledge and he is almost ready to begin his professional life. In the process of learning Structured Programming, it is necessary the use of teaching techniques that let students get thoroughly involved in building programs efficiently. This is the case of pedagogical focus based on the constructivism methodology with a pedagogical strategy solving problems and learning with a metacognition orientation based on the successful education for Structured Programming specifically, using programming languages like C ++, Visual Basic 6, Visual Basic Net, hypertext protocol, Java, among others. It should be mentioned that the main objective of this research is to develop a study with Learning Methodologies for Structured Programming using constructivist techniques. The specific objectives are based on establishing teaching events in the processes of meaningful learning of students; defining the percentage that teachers involved technologies in their classroom processes in terms of programming, classifying teachers into levels of knowledge about using constructivist programming technologies for teaching. Teachers should positively have as a part of his pro le the knowledge of ICT in terms of software creation and the use of methodologies and resources doing teachers’ role.
APA, Harvard, Vancouver, ISO, and other styles
50

Wamhoff, Eike-Christian, James L. Banal, William P. Bricker, Tyson R. Shepherd, Molly F. Parsons, Rémi Veneziano, Matthew B. Stone, Hyungmin Jun, Xiao Wang, and Mark Bathe. "Programming Structured DNA Assemblies to Probe Biophysical Processes." Annual Review of Biophysics 48, no. 1 (May 6, 2019): 395–419. http://dx.doi.org/10.1146/annurev-biophys-052118-115259.

Full text
Abstract:
Structural DNA nanotechnology is beginning to emerge as a widely accessible research tool to mechanistically study diverse biophysical processes. Enabled by scaffolded DNA origami in which a long single strand of DNA is weaved throughout an entire target nucleic acid assembly to ensure its proper folding, assemblies of nearly any geometric shape can now be programmed in a fully automatic manner to interface with biology on the 1–100-nm scale. Here, we review the major design and synthesis principles that have enabled the fabrication of a specific subclass of scaffolded DNA origami objects called wireframe assemblies. These objects offer unprecedented control over the nanoscale organization of biomolecules, including biomolecular copy numbers, presentation on convex or concave geometries, and internal versus external functionalization, in addition to stability in physiological buffer. To highlight the power and versatility of this synthetic structural biology approach to probing molecular and cellular biophysics, we feature its application to three leading areas of investigation: light harvesting and nanoscale energy transport, RNA structural biology, and immune receptor signaling, with an outlook toward unique mechanistic insight that may be gained in these areas in the coming decade.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Structured programming' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography