Bandera: extracting finite-state models from Java source code

2002 ◽  
Author(s):  
J.C. Corbett ◽  
M.B. Dwyer ◽  
J. Hatcliff ◽  
S. Laubach ◽  
C.S. Pasareanu ◽  
...  
Keyword(s):  
Source Code ◽  
Finite State ◽  
State Models ◽  
Finite State Models

FINITE STATE MODELS WITH BOOLEAN VARIABLES

1968 ◽  
pp. 207-222
Author(s):  
L.E. OSTRANDER ◽  
J.D. SCHOEFFLER ◽  
D.S. GANN
Keyword(s):  
Finite State ◽  
State Models ◽  
Finite State Models

Extended Finite State Models of Language (review)

Language ◽  
2001 ◽  
Vol 77 (3) ◽  
pp. 610-610
Author(s):  
Michael A. Covington
Keyword(s):  
Finite State ◽  
State Models ◽  
Finite State Models

scholarly journals Statistical compression of protein sequences and inference of marginal probability landscapes over competing alignments using finite state models and Dirichlet priors

2019 ◽  
Vol 35 (14) ◽  
pp. i360-i369
Author(s):  
Dinithi Sumanaweera ◽  
Lloyd Allison ◽  
Arun S Konagurthu
Keyword(s):  
Ad Hoc ◽  
Inductive Reasoning ◽  
Protein Sequences ◽  
Information Criterion ◽  
Supplementary Information ◽  
Marginal Probability ◽  
Source Program ◽  
Finite State ◽  
State Models ◽  
Finite State Models

AbstractThe information criterion of minimum message length (MML) provides a powerful statistical framework for inductive reasoning from observed data. We apply MML to the problem of protein sequence comparison using finite state models with Dirichlet distributions. The resulting framework allows us to supersede the ad hoc cost functions commonly used in the field, by systematically addressing the problem of arbitrariness in alignment parameters, and the disconnect between substitution scores and gap costs. Furthermore, our framework enables the generation of marginal probability landscapes over all possible alignment hypotheses, with potential to facilitate the users to simultaneously rationalize and assess competing alignment relationships between protein sequences, beyond simply reporting a single (best) alignment. We demonstrate the performance of our program on benchmarks containing distantly related protein sequences.Availability and implementationThe open-source program supporting this work is available from: http://lcb.infotech.monash.edu.au/seqmmligner.Supplementary informationSupplementary data are available at Bioinformatics online.

scholarly journals Learning finite-state models for machine translation

2006 ◽  
Vol 66 (1) ◽  
pp. 69-91 ◽  
Author(s):  
Francisco Casacuberta ◽  
Enrique Vidal
Keyword(s):  
Machine Translation ◽  
Finite State ◽  
State Models ◽  
Finite State Models
Sign in / Sign up

Export Citation Format

Share Document