Often, problems in biological sequence analysis are just a matter of putting the right label on each residue. In gene identification, we want to label nucleotides as exons, introns, or intergenic sequence. In sequence alignment, we want to associate residues in a query sequence with ho

This product or document is protected by copyright and distributed under licenses restricting its use, copying, distribution, and decompilation. No part of this product or document may be reproduced in any form by any means without prior written authorization of Sun and its licensors, if any

). While defining the class of quasi-tilted algebras in [17], Happel, Re-iten and Smalø have introduced two classes of modules which turned out to be very useful in the representation theory of algebras. Let A be an artin algebra, and modA denote the category of finitely generated right A

An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part

-hemisphere supplementary and premotor areas; storage of spatial information activates the right-hemisphere premotor cortex; and storage of object information activates other areas of the prefrontal cortex. Two of the fundamental executive processes are selective attention and task management. Both processes activate

We present a method for translating the synchronisation behaviour of a process oriented discrete event simulation language into a process algebra. Such translations serve two purposes. The first exploits the formal structure of the target process algebraic representations to enable proofs of such properties of the source system as deadlock freedom, safety, fairness and liveness which can be very difficult to establish by simulation experiment. The second exploits the denotational semantics to better understand the language constructs as abstract entities and to facilitate reasoning about simulation models. Here we give the intuition and the basic translation mechanisms using a variety of the Demos simulation language and the CCS and SCCS process algebras. The translations have been automated as SML programs and produce CWB compatible input allowing the automated checking of formal system properties. Keywords: process algebras; simulation; verification. 1 Introduction Many complex pr...

this paper, we formalise our translation schemata from core Demos and extend them to cover wait until and conditional commands. We also cite several theorems derivable from the translations and give applications. 5 Translating core Demos

, denominations, and other information shown on any map in this work do not imply on the part of the World Bank any judgment of the legal status of any territory or the endorsement or acceptance of such boundaries. Rights and Permissions The material in this work is copyrighted. No part of this work may

Copyright c○2004 by the authors. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher.

In this paper we introduce two methods for building LALR parsers for regular right part grammars (RRPGs). Both methods build a parser directly from a grammar, require no extra state or data structure, and can deal with all LALR RRPGs. The rst method is quite simple. For almost all LALR RRPGs