PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Waack, Stephan"

Author of the publication

copydeleteadd this publication to your clipboard
Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models.

, , , , , , , , and . BMC Bioinformatics, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Prof. Dr. -Ing. Karl Stephan University of Stuttgart

Dr. -Ing. Stephan Heimerl University of Stuttgart

Silke Stephan University of Stuttgart

Stephan Renninger University of Stuttgart

Stephan Bachmann University of Stuttgart

 

Other publications of authors with the same name

Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance., , and . Inf. Process. Lett., 98 (1): 6-10 (2006)Deployable Capture/Replay Supported by Internal Messages., , , and . Advances in Computers, (2012)Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In., and . Mathematical Systems Theory, 28 (6): 553-564 (1995)On the Halting Problem for Automata in Cones., and . Elektronische Informationsverarbeitung und Kybernetik, 18 (9): 489-499 (1982)Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs., and . Complexity Theory: Current Research, page 273-290. Cambridge University Press, (1992)A novel hybrid gene prediction method employing protein multiple sequence alignments., , , and . Bioinformatics, 27 (6): 757-763 (2011)Lower Bounds on The Complexity of Real-Time Branching Programs., and . ITA, 22 (4): 447-459 (1988)Tape Complexity of Word Problems.. FCT, volume 117 of Lecture Notes in Computer Science, page 467-471. Springer, (1981)The "log Rank" Conjecture for Modular Communication Complexity., and . STACS, volume 1046 of Lecture Notes in Computer Science, page 619-630. Springer, (1996)Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines., , and . Computational Complexity Conference, page 240-249. IEEE Computer Society, (1989)