Author of the publication

A novel hybrid gene prediction method employing protein multiple sequence alignments.

, , , and . Bioinformatics, 27 (6): 757-763 (2011)

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.

 

Other publications of authors with the same name

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)Deployable Capture/Replay Supported by Internal Messages., , , and . Advances in Computers, (2012)Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance., , and . Inf. Process. Lett., 98 (1): 6-10 (2006)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)Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines., , and . Computational Complexity Conference, page 240-249. IEEE Computer Society, (1989)The "log Rank" Conjecture for Modular Communication Complexity., and . STACS, volume 1046 of Lecture Notes in Computer Science, page 619-630. Springer, (1996)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)