( en | de | ru )

 

Disambiguation of "Waack, Stephan"

Author of the publication

copydeleteadd this publication to your clipboard
Gene prediction with a hidden Markov model and a new intron submodel.

, and . ECCB, page 215-225. (2003)

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.

Stephan Waack

Stephan Waack

Matthias Waack

Karl-Friedrich Waack

Inara Waack

 

Other publications of authors with the same name

Monitoring Software Quality by Means of Simulation Methods., , , , and . ESEM, page 11:1-11:6. ACM, (2016)A Novel Sequence-Based Feature for the Identification of DNA-Binding Sites in Proteins Using Jensen-Shannon Divergence., , , , and . Entropy, 18 (10): 379 (2016)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)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)Demonstrating non-inferiority of easy interpretable methods for insolvency prediction., and . Expert Syst. Appl., 42 (23): 9117-9128 (2015)The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract).. MFCS, volume 452 of Lecture Notes in Computer Science, page 492-498. Springer, (1990)On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers.. Canada-France Conference on Parallel and Distributed Computing, volume 805 of Lecture Notes in Computer Science, page 35-44. Springer, (1994)TTCN-3 Quality Engineering: Using Learning Techniques to Evaluate Metric Sets., , , , , and . SDL Forum, volume 4745 of Lecture Notes in Computer Science, page 54-68. Springer, (2007)Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems., and . MFCS, volume 969 of Lecture Notes in Computer Science, page 299-308. Springer, (1995)