Oxford Index Search Results

You are looking at 1-10 of 14 items for:

pseudocode x clear all

Refine by type

Refine by product

 

pseudocode

Overview page. Subjects: Computing.

Another name for pseudolanguage.

See overview in Oxford Index

pseudocode

Overview page. Subjects: Computing.

Another name for pseudolanguage.

See overview in Oxford Index

pseudocode

Edited by Andrew Butterfield and Gerard Ekembe Ngondi.

in A Dictionary of Computer Science

January 2016; p ublished online January 2016 .

Reference Entry. Subjects: Computing. 5 words.

Another name for pseudolanguage.

Go to Oxford Reference »  home page

pseudocode

John Daintith and Edmund Wright.

in A Dictionary of Computing

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Computing. 5 words.

Another name for pseudolanguage.

Go to Oxford Reference »  home page

Generating Random Networks and Graphs

Ton Coolen, Alessia Annibale and Ekaterina Roberts.

March 2017; p ublished online May 2017 .

Book. Subjects: Mathematical and Statistical Physics. 336 pages.

This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where...

Go to Oxford Scholarship Online »  abstract

SaRAD: a Simple and Robust Abbreviation Dictionary

Eytan Adar.

in Bioinformatics

March 2004; p ublished online January 2004 .

Journal Article. Subjects: Bioinformatics and Computational Biology. 0 words.

Motivation: Due to recent interest in the use of textual material to augment traditional experiments it has become necessary to automatically cluster, classify and filter...

Go to Oxford Journals »  abstract

Agent-Based Computational Model

Joshua M. Epstein.

in Agent_Zero

February 2014; p ublished online October 2017 .

Chapter. Subjects: Applied Mathematics. 7759 words.

This part describes the agent-based and computational model for Agent_Zero and demonstrates its capacity for generative minimalism. It first explains the replicability of the model before...

Go to Princeton University Press »  abstract

Graphs with hard constraints: further applications and extensions

A.C.C. Coolen, A. Annibale and E.S. Roberts.

in Generating Random Networks and Graphs

March 2017; p ublished online May 2017 .

Chapter. Subjects: Mathematical and Statistical Physics. 25694 words.

This chapter looks at further topics pertaining to the effective use of Markov Chain Monte Carlo to sample from hard- and soft-constrained exponential random graph models. The chapter...

Go to Oxford Scholarship Online »  abstract

Phrasing Questions by Writing Algorithms

Mark D. LeBlanc and Betsey Dexter Dyer.

in Perl for Exploring DNA

August 2007; p ublished online April 2010 .

Chapter. Subjects: Biomathematics and Statistics. 4585 words.

This chapter provides guidelines for designing and outlining programs with two sequence aligning programs — BLAST and BLAT — as well as making a DNA Dictionary as examples. Algorithms...

Go to Oxford Scholarship Online »  abstract

Computational Identification of Natural Peptides based on Analysis of Molecular Evolution

Amir Toporik, Itamar Borukhov, Avihay Apatoff, Doron Gerber and Yossef Kliger.

in Bioinformatics

January 2014; p ublished online April 2014 .

Journal Article. Subjects: Bioinformatics and Computational Biology. 0 words.

Motivation: Many secretory peptides are synthesized as inactive precursors that must undergo post-translational processing to become biologically active peptides. Attempts to...

Go to Oxford Journals »  abstract

An efficient, versatile and scalable pattern growth approach to mine frequent patterns in unaligned protein sequences

Kai Ye, Walter A. Kosters and Adriaan P. IJzerman.

in Bioinformatics

March 2007; p ublished online January 2007 .

Journal Article. Subjects: Bioinformatics and Computational Biology. 5437 words.

Motivation: Pattern discovery in protein sequences is often based on multiple sequence alignments (MSA). The procedure can be computationally intensive and often requires...

Go to Oxford Journals »  abstract