A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
An algorithm for structuring programs (Extended Abstract)
1976
Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76
Preserved Fulltext
Mcllroy for their helpful comments on this paper. ...
An example of a program structured by struct is included at the end of the paper. The structuring algorithm presented in this paper is proposed as a tool for the maintenance of fortran programs. ...
Goals of structuring This section defines flowgraphs, a simple structured language SL, and what it means for an SL program to be a structuring of a flowgraph. ...
doi:10.1145/800168.811545
dblp:conf/popl/Baker76
fatcat:huue5ord75avzbvgw5vwkyxxqi
An efficient algorithm for type-safe structural diffing
2019
Proceedings of the ACM on Programming Languages (PACMPL)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper presents an alternative datatype generic algorithm for computing the difference between two values of any algebraic datatype. ...
The de facto standard tool used by most version control systems is the UNIX diff utility, that compares two files on a line-by-line basis without any regard for the structure of the data stored in these ...
Conclusions Throughout this paper we have developed an efficient type-directed algorithm for computing structured differences for a large class of algebraic datatypes, namely, mutually recursive families ...
doi:10.1145/3341717
fatcat:4cmuozxgafafhme2rh4u2glbsm
An Efficient Dynamic Programming Algorithm and Implementation for RNA Secondary Structure Prediction
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose a new dynamic programming algorithm for RNA secondary structure prediction by analyzing energy rules. ...
The basic dynamic programming algorithm needs O(n 4 ) time to calculate the minimum free energy for RNA secondary structure. ...
Dynamic programming algorithms (Zuker et al, 1989 ) based on the minimum free energy model are practical methods for RNA secondary structure prediction without pseudo-knots. ...
doi:10.1007/11428848_111
fatcat:fy5ml7ksvrcnfpkvf2uxur6ypy
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
2002
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The dynamic programming algorithm for aligning a CM to an RNA sequence of length N is O(N3) in memory. This is only practical for small RNAs. ...
I describe a divide and conquer variant of the alignment algorithm that is analogous to memory-efficient Myers/Miller dynamic programming algorithms for linear sequence alignment. ...
I also wish to thank Elena Rivas and Robin Dowell for critical comments on the manuscript. ...
pmid:12095421
pmcid:PMC119854
fatcat:j4zsregp5fgtzn4xbfyjcdya3a
Design and Implementation of an Efficient Algorithm Using Data Structures: A Recipe for the Structured Process Called Top Down Programming
2013
Journal of Educational and Social Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The main aim of this paper is a revisiting of the generic top down programming approach in solving and implementation of an efficient algorithm. we went into these research because programming is traditionally ...
This paper discusses the benefits of this approach and how it is used in an object oriented world. ...
The design of the data structures is an activity that is just as important but is largely outside of the scope of top-down design. It is difficult to reuse work done for other projects. ...
doi:10.5901/jesr.2013.v3n9p17
fatcat:457djakytfezljdsqj2bi7ohp4
An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
2017
Journal of Cheminformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
of 243,130 natural products and designed an efficient algorithm to precisely identify the chemical structures. ...
A dynamic programming (DP) algorithm can solve this NP-complete problem in pseudo-polynomial time after converting floating point molecular weights into integers. ...
In our DPforCSCCP algorithm, the program finished within 1.5 h for all cases. ...
doi:10.1186/s13321-017-0244-9
pmid:29143270
pmcid:PMC5688056
fatcat:25tilika7fcuvnbosucsso2rgu
An Interactive Fuzzy Satisficing Method for Multiobjective Nonlinear Integer Programming Problems with Block-Angular Structures through Genetic Algorithms with Decomposition Procedures
2009
Advances in Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For deriving a satisficing solution for the decision maker, we develop an interactive fuzzy satisficing method. ...
Realizing the block-angular structures that can be exploited in solving problems, we also propose genetic algorithms with decomposition procedures. ...
Now we are ready to introduce the genetic algorithm with decomposition procedures as an approximate solution method for nonlinear integer programming problems with block angular structures. ...
doi:10.1155/2009/372548
fatcat:fn6lkio2ojgxnf4ksl2qnyqima
An Algorithm Searching for Point Subsets with Applications to the Analysis of the Atomic Structure of Modelled Clusters
Алгоритм поиска точечных подмножеств и его применение для анализа атомной структуры модельных кластеров
2014
Bulletin of the South Ural State University Series Mathematical Modelling Programming and Computer Software
Алгоритм поиска точечных подмножеств и его применение для анализа атомной структуры модельных кластеров
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
To nd coordination polyhedra, we propose an algorithm searching for point subsets using a template. We apply the method to clusters of various form, structure, and composition. ...
The algorithm is implemented in a program which enables us to nd coordination polyhedra, construct the corresponding graph, and calculate the invariants. ...
doi:10.14529/mmp140204
fatcat:z66tszqxn5aw3ooquashl6q44e
A Dynamic Programming Algorithm for Finding the Optimal Segmentation of an RNA Sequence in Secondary Structure Predictions
2010
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The secondary structure of each chunk is predicted independently, then combined with the structures predicted for the other chunks, to generate a complete secondary structure prediction that is thus a ...
In this paper, we present a dynamic programming algorithm that runs in polynomial time and allows us to achieve the optimal, non-overlapping segmentation of a long RNA sequence into segments (chunks). ...
) [2] and use a dynamic programming algorithm to build the secondary structure prediction. ...
pmid:25705724
pmcid:PMC4335647
fatcat:lfe2njbvcbeqnkh6yq6bsgw5p4
Discovering Relationships between Data Structures and Algorithms
2013
Journal of Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For this reason, we propose an approach to organize the program code resources together with the programming problems systematically in terms of algorithms and data structures. ...
These program code resources are not organized for students to learn data structures and algorithms although they contain much knowledge of data structures and algorithms. ...
We propose an algorithm CreateIndividual, which is used to create an individual for a program code. The following variables are needed in this algorithm. ...
doi:10.4304/jsw.8.7.1726-1735
fatcat:kweavaiqjbebxfp54jxrczzarm
Algorithmic profiling
2012
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It does that by automatically determining the "inputs" of a program, by measuring the program's "cost" for any given input, and by inferring an empirical cost function. ...
In this paper we introduce the idea of algorithmic profiling. While a traditional profiler determines a set of measured cost values, an algorithmic profiler determines a cost function. ...
The program in Listing 1 shows an implementation of the insertion sort algorithm for a linked list. ...
doi:10.1145/2254064.2254074
dblp:conf/pldi/ZaparanuksH12
fatcat:tne5bv2vvfdjplugslb66y6sce
AlgoWiki: an Open Encyclopedia of Parallel Algorithmic Features
2015
Supercomputing Frontiers and Innovations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Machine-dependent, part of this work is devoted to describing features of algorithms implementation for different parallel architectures. ...
A detailed description of a given algorithm with a special emphasis on its parallel properties is made once, and after that it can be used repeatedly for various implementations of the algorithm on different ...
The research presented in Sections 4.4 and 4.5 is supported by the Russian Foundation for Basic Research, grant N 13-07-00790. ...
doi:10.14529/jsfi150101
fatcat:xsbtqtmilref5a4hwe3lokhody
SE: an algorithm for deriving sequence alignment from a pair of superimposed structures
2009
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Generating sequence alignments from superimposed structures is an important part of many structure comparison programs. ...
Many programs use a dynamic programming algorithm to generate the sequence alignment from superimposed structures. ...
The natural algorithm for doing this is the dynamic programming algorithm. ...
doi:10.1186/1471-2105-10-s1-s4
pmid:19208141
pmcid:PMC2648757
fatcat:jcugtck6jnfkxd3d6hxfds7tfa
Discovering Algorithmic Relationship between Programming Resources on the Web
2013
Applied Mechanics and Materials
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Algorithmic relationships are discovered here for programming tutoring. ...
An algorithm can solve different programming problems and a programming problem also can be solved by different algorithms. ...
Algorithmic Templates An algorithmic template represents the common program plan for many source codes. An algorithmic structure can be extracted from its algorithmic template in this paper. ...
doi:10.4028/www.scientific.net/amm.347-350.2430
fatcat:5jlka5znhjandbrlgj7vjrvjzq
IMAGE-PROCESSING PROJECTS FOR AN ALGORITHMS COURSE
2001
International journal of pattern recognition and artificial intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We also appreciate the help of Josh Johnson, the teaching assistant for the algorithms course. ...
The work on the materials for the programming projects was partially sponsored by the National Science Foundation grant No. DUE-9980832. ...
An integration of an algorithms course with programming tasks may help the students to understand theory and develop skills for its application. ...
doi:10.1142/s0218001401001192
fatcat:uttjdtguoverlerop55ac7c754
« Previous
Showing results 1 — 15 out of 1,360,281 results