- BIOINFORMATICS APPLICATIONS NOTE Vol. 20 no. 17 2004, pages 32613262
- A Compositional Sweep-Line State Space Exploration Method
- Obtaining Memory-Ecient Reachability Graph
- Exploiting Equivalence Reduction and the Sweep-Line
- State Space Methods for Timed Coloured Petri Nets
- A Generalised Sweep-Line Method for Safety Properties
- BioMed Central Page 1 of 13
- A Generalised Sweep-Line Method for Safety Properties
- Sweep-Line State Space Exploration for Coloured Petri Nets ?
- Sweep-Line State Space Exploration for Coloured
- Using biological networks to search for interacting loci in genome-wide association studies
- Vol. 23 no. 22 2007, pages 29782986 BIOINFORMATICS ORIGINAL PAPER doi:10.1093/bioinformatics/btm472
- Vol. 22 no. 18 2006, pages 23172318 doi:10.1093/bioinformatics/btl153BIOINFORMATICS APPLICATIONS NOTE
- BioMed Central Page 1 of 6
- BioMed Central Page 1 of 7
- BIOINFORMATICS APPLICATIONS NOTE Vol. 20 no. 10 2004, pages 16361637
- Inference of Large Phylogenies Using Neighbour-Joining Martin Simonsen, Thomas Mailund, and Christian N.S. Pedersen
- BUILDING VERY LARGE NEIGHBOUR-JOINING TREES Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen
- Rapid Neighbour-Joining Martin Simonsen, Thomas Mailund, and Christian N.S. Pedersen
- Algorithms for Computing the Quartet Distance between Trees of Arbitrary Degree
- Initial experiences with GeneRecon on MiG Thomas Mailund and Christian N.S. Pedersen
- SplitDist--Calculating Split-Distances for Sets of Trees Thomas Mailund
- Getting Started with HapCluster An introduction to the HapCluster association mapping tool
- Getting Started with Blossoc An introduction to the Blossoc association mapping tool
- Copyright 2009 by the Genetics Society of America DOI: 10.1534/genetics.109.103010
- Analysing In nite-State Systems by Combining
- HMMlib: A C++ Library for General Hidden Markov Models Exploiting Modern CPUs
- July 8, 2006 8:48 Proceedings Trim Size: 9.75in x 6.5in all-pairs-qdist COMPUTING THE ALL-PAIRS QUARTET DISTANCE ON A SET OF
- A SweepLine Method for State Space Exploration
- Obtaining Memory-Ecient Reachability Graph Representations Using the Sweep-Line Method
- Introduction In this chapter we introduce the research eld of state space methods and
- Condensed State Sp aces for Timed Petri Nets
- ample set, 65 arc hook, 17
- successfully industrialsized
- Bibliography [1] AT&T FSM Library, Online http://www.research.att.com/sw/tools/
- Sweeping the State Space A Sweep-Line State Space Exploration Method
- Copyright 2007 by the Genetics Society of America DOI: 10.1534/genetics.107.071126
- Copyright 2011 by the Genetics Society of America DOI: 10.1534/genetics.110.124164
- Path Finding with the Sweep-Line Method using External Storage
- BioMed Central Page 1 of 8
- Future Generation Computer Systems 23 (2007) 580586 www.elsevier.com/locate/fgcs
- A Compositional Sweep-Line State Space Exploration Method ?
- AlcomFT Technical Report Series ALCOMFTTR03102
- CoaSim Guile Manual Using the Guile-based CoaSim Simulator
- Copyright 2009 by the Genetics Society of America DOI: 10.1534/genetics.108.092643
- A sub-cubic time algorithm for computing the quartet distance between two general trees
- BIOINFORMATICS ORIGINAL PAPER Vol. 24 no. 19 2008, pages 22152221
- Separation of Style and Content with XML in an Interchange Format for High-level Petri Nets
- A quadratic time algorithm for computing the quartet distance between two general trees
- Path Finding with the Sweep-Line Method using
- The increasing pervasiveness and complexity of IT systems has lead to the unfortunate situation where IT systems are both becoming more critical for
- BioMed Central Page 1 of 22
- Analysing In nite-State Systems by Combining Equivalence Reduction
- A Sweep-Line Method for State Space Exploration
- Getting Started with GeneRecon An introduction to the association mapping tool GeneRecon
- Getting Started with CoaSim An introduction to the simulator CoaSim
- A Compositional Sweep-Line State Space Exploration
- Coloured Petri Nets { A Tool in Software Engineering
- July 8, 2006 8:55 Proceedings Trim Size: 9.75in x 6.5in nlogn COMPUTING THE QUARTET DISTANCE BETWEEN EVOLUTIONARY
- Genomic Relationships and Speciation Times of Human, Chimpanzee, and Gorilla Inferred
- BioMed Central Page 1 of 13
- BIOINFORMATICS APPLICATIONS NOTE Vol. 21 no. 8 2005, pages 17111712
- Incomplete lineage sorting patterns among human, chimpanzee, and orangutan suggest recent orangutan
- Vol. 23 no. 9 2007, pages 10801089 BIOINFORMATICS ORIGINAL PAPER doi:10.1093/bioinformatics/btm078
- ACCEPTED FOR PUBLICATION: IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS: PART A. SYSTEMS AND HUMANS , (IN PRESS) 1 Exploiting Equivalence Reduction and the
- Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii
- A New Powerful Method For Genome-wide Association Mapping Using Local Genealogies In A
