Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ján Manuch
2010 – today
- 2013
[c35]Ján Manuch, Murray Patterson, Roland Wittler, Cedric Chauve, Eric Tannier: Linearization of ancestral multichromosomal genomes. CTW 2013: 169-173- 2012
- [j28]Ján Manuch, Murray Patterson, Roland Wittler, Cedric Chauve, Eric Tannier: Linearization of ancestral multichromosomal genomes. BMC Bioinformatics 13(S-19): S11 (2012)
- [j27]Ján Manuch, Murray Patterson, Cedric Chauve: Hardness results on the gapped consecutive-ones property problem. Discrete Applied Mathematics 160(18): 2760-2768 (2012)
- [j26]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. Journal of Computational Biology 19(4): 439-454 (2012)
- [j25]Ján Manuch, Ladislav Stacho, Christine Stoll: Step-wise tile assembly with a constant number of tile types. Natural Computing 11(3): 535-550 (2012)
- [c34]
- [c33]Bahar Behsaz, Ján Manuch, Ladislav Stacho: Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA 2012: 1-11
- [c32]Anne Condon, Bonnie Kirkpatrick, Ján Manuch: Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems. DNA 2012: 43-57
- [i2]Anne Condon, Ján Manuch, Chris Thachuk: The complexity of string partitioning. CoRR abs/1204.2201 (2012)
- 2011
- [j24]Roland Wittler, Ján Manuch, Murray Patterson, Jens Stoye: Consistency of Sequence-Based Gene Clusters. Journal of Computational Biology 18(9): 1023-1039 (2011)
- [j23]Ján Manuch, Murray Patterson: The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree. Journal of Computational Biology 18(9): 1243-1253 (2011)
- [j22]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon: NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing 10(1): 391-405 (2011)
- [c31]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech: Evolutionary Conservation of Human Phosphorylation Sites. BIBM 2011: 222-227
- [c30]Cedric Chauve, Ján Manuch, Murray Patterson, Roland Wittler: Tractability Results for the Consecutive-Ones Property with Multiplicity. CPM 2011: 90-103
- [c29]Anne Condon, Alan J. Hu, Ján Manuch, Chris Thachuk: Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems. DNA 2011: 84-99
- [c28]Ján Manuch, Murray Patterson, Arvind Gupta: Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees. ISBRA 2011: 440-451
- 2010
- [j21]Ján Manuch, Ladislav Stacho, Christine Stoll: Two Lower Bounds for Self-Assemblies at Temperature 1. Journal of Computational Biology 17(6): 841-852 (2010)
- [j20]Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring via Galled-Tree Networks Is NP-Complete. Journal of Computational Biology 17(10): 1435-1449 (2010)
- [c27]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech: Prediction of human protein kinase substrate specificities. BIBM 2010: 259-264
- [c26]Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk: Complexity of Finding Non-Planar Rectilinear Drawings of Graphs. Graph Drawing 2010: 305-316
- [c25]Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon: An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing 2010: 108-119
- [c24]Ján Manuch, Murray Patterson: The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree. RECOMB-CG 2010: 278-289
2000 – 2009
- 2009
- [j19]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discrete Applied Mathematics 157(10): 2310-2324 (2009)
- [j18]Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho: The Odd-Distance Plane Graph. Discrete & Computational Geometry 42(2): 132-141 (2009)
- [j17]Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho: Spanning cubic graph designs. Discrete Mathematics 309(18): 5781-5788 (2009)
- [j16]Cedric Chauve, Ján Manuch, Murray Patterson: On the Gapped Consecutive-Ones Property. Electronic Notes in Discrete Mathematics 34: 121-125 (2009)
- [j15]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model. Journal of Computational Biology 16(1): 19-30 (2009)
- [j14]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model. Journal of Computational Biology 16(6): 769-802 (2009)
- [c23]Ján Manuch, Murray Patterson, Arvind Gupta: On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON 2009: 268-276
- [c22]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon: NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA 2009: 106-115
- [c21]Ján Manuch, Ladislav Stacho, Christine Stoll: Step-Assembly with a Constant Number of Tile Types. ISAAC 2009: 954-963
- [c20]Ján Manuch, Ladislav Stacho, Christine Stoll: Two lower bounds for self-assemblies at temperature 1. SAC 2009: 808-809
- [i1]Cedric Chauve, Ján Manuch, Murray Patterson: Hardness Results for the Gapped Consecutive-Ones Property. CoRR abs/0912.0309 (2009)
- 2008
- [j13]Ján Manuch, Daya Ram Gaur: Fitting protein Chains to cubic Lattice is NP-Complete. J. Bioinformatics and Computational Biology 6(1): 93-106 (2008)
- [j12]Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: On the Complexity of Ordered Colorings. SIAM J. Discrete Math. 22(2): 832-847 (2008)
- [c19]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. APBC 2008: 49-58
- [c18]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: Inverse protein folding in 3D hexagonal prism lattice under HP model. BIOCOMP 2008: 619-625
- [c17]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: A Robust Class of Stable Proteins in the 2D HPC Model. BIRD 2008: 180-192
- [c16]Anne Condon, Ján Manuch, Chris Thachuk: Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. COCOON 2008: 265-275
- [c15]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298
- 2007
- [c14]Ján Manuch, Daya Ram Gaur: Fitting Protein Chains to Cubic Lattice is NP-Complete. APBC 2007: 153-164
- [c13]Arvind Gupta, Mehdi Karimi, Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey: Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. BIOCOMP 2007: 362-369
- [c12]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132
- 2006
- [j11]Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho: Characterization of the Existence of Galled-tree Networks. J. Bioinformatics and Computational Biology 4(6): 1309-1328 (2006)
- [c11]Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch: Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD 2006: 85-94
- [c10]Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta: Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306
- [c9]Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta: Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR 2006: 452-466
- 2005
- [j10]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Ordered 3-colorings. Electronic Notes in Discrete Mathematics 22: 299-300 (2005)
- [j9]Arvind Gupta, Ján Manuch, Ladislav Stacho: Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. Journal of Computational Biology 12(10): 1328-1345 (2005)
- [j8]Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho: (quasi) Spanners for Mobile Ad Hoc Networks. Journal of Interconnection Networks 6(2): 63-84 (2005)
- 2004
- [c8]Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu: Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243
- [c7]Arvind Gupta, Ján Manuch, Ladislav Stacho: Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318
- [c6]Arvind Gupta, Ján Manuch, Ladislav Stacho: Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208
- 2003
- [j7]Ján Manuch, Ladislav Stacho: On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. ITA 37(3): 255-270 (2003)
- [j6]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski: A defect theorem for bi-infinite words. Theor. Comput. Sci. 292(1): 237-243 (2003)
- [j5]Pavol Duris, Ján Manuch: On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003)
- 2002
- [j4]Juhani Karhumäki, Ján Manuch: Multiple factorizations of words and defect effect. Theor. Comput. Sci. 273(1-2): 81-97 (2002)
- 2001
- [j3]Ján Manuch: Defect Effect of Bi-infinite Words in the Two-element Case. Discrete Mathematics & Theoretical Computer Science 4(2): 273-290 (2001)
- [j2]Julien Cassaigne, Juhani Karhumäki, Ján Manuch: On Conjugacy of Languages. ITA 35(6): 535-550 (2001)
- [c5]
- 2000
- [j1]Ján Manuch: Construction of very hard functions for multiparty communication complexity. ITA 34(1): 61-76 (2000)
1990 – 1999
- 1999
- [c4]Ján Manuch: Characterization of a word by its subwords. Developments in Language Theory 1999: 210-219
- [c3]
- [c2]Ján Manuch, Laszlo Stacho: Fault-Tolerant Wavelength Allocations in All-optical Hypercubes. SIROCCO 1999: 219-222
- 1998
- [c1]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski: On Defect Effect of Bi-Infinite Words. MFCS 1998: 674-682
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-18 02:39 CEST by the dblp team