James King

Learn More
The emergence of shared symbol systems is considered to be a pivotal moment in human evolution and human development. These changes are normally explained by reference to changes in people's internal cognitive processes. We present 2 experiments which provide evidence that changes in the external, collaborative processes that people use to communicate can(More)
This paper describes the results of corpus and experimental investigation into the factors that affect the way clarification questions in dialogue are interpreted, and the way they are responded to. We present some results from an investigation using the BNC which show some general correlations between clarification request type, likelihood of answering,(More)
A new technique for integrating experimental manipulations into text-based, synchronous dialogue is introduced. This method supports fine-grained, systematic transformation of conversational turns and the introduction of 'artificial' probe turns and turn sequences. It can be used to introduce manipulations that are sensitive to aspects of the local(More)
BACKGROUND We introduce Sequence Bundles--a novel data visualisation method for representing multiple sequence alignments (MSAs). We identify and address key limitations of the existing bioinformatics data visualisation methods (i.e. the Sequence Logo) by enabling Sequence Bundles to give salient visual expression to sequence motifs and other data features,(More)
Using field experiments and mathematical models, we tested whether internal waves enhance photosynthesis as they move phytoplankton through a nonlinear light field in situations where photosynthesis is light limited. Phytoplankton circulated at depths mimicking isotherm displacement for moderate wind speeds had elevated photosynthetic rates compared to(More)
Sequence Logos and its variants are the most commonly used method for visualization of multiple sequence alignments (MSAs) and sequence motifs. They provide consensus-based summaries of the sequences in the alignment. Consequently, individual sequences cannot be identified in the visualization and covariant sites are not easily discernible. We recently(More)
The PROJECTION algorithm by Buhler and Tompa is one of the best existing methods for solving hard motif discovery problems for monad motifs of fixed length l. In this paper we introduce the AGGREGA-TION algorithm, which like PROJECTION projects all l-mers from the given input sequences into buckets, but uses a different scheme for selecting buckets for(More)
In 2001 Buhler and Tompa [BT01] introduced their Projection algorithm for solving the motif discovery problem for motifs of fixed length l. The algorithm finds good candidates for local optimisation by projecting all l-mers present in the input onto a smaller subspace and analysing dense points in that subspace. We have developed Ag-gregation, a modified(More)