Publications
X Chromosome. In: Handbook of Forensic Genetics.; Submitted. 1. p. 193-215p. Edit
Central pattern generators for bipedal locomotion. J. Math. Biol.. 2006;53:474-489.Edit
Paternity exclusion power: Comparative behaviour of autosomal and X-chromosomal markers in standard and deficient cases with inbreeding. Forensic Science International: Genetics. 2013;7:290-295.Edit
Power Law and Entropy Analysis of Catastrophic Phenomena. Mathematical Problems in Engineering. 2013;2013:10.Edit
Identification of species by multiplex analysis of variable-length sequences. Nucleic Acids Research. 2010;38.
Complex order biped rhythms. International Journal of Bifurcation and Chaos. 2011;21:3053-3061.Edit
Fractional complex-order model for HIV infection with drug resistance during therapy. Journal of Vibration and Control. 2016;22(9):2222-2239.Edit
Theory and statistics of mutation rates: A mathematical framework reformulation for forensic applications. Forensic Science International: Genetics Supplement Series. 2015;5:e131-e132.Edit
Double power laws, fractals and self-similarity. Applied Mathematical Modelling. 2014;38:4019-4026.Edit
Straightforward inference of ancestry and admixture proportions through ancestry-informative insertion deletion multiplexing. PLoS ONE. 2012;7.Edit
Distinguishing kinship from genealogical likelihoods. Forensic Science International: Genetics Supplement Series. 2009;2:453-454.Edit
Numerical simulations in two CPG models for bipedal locomotion. J. Vib. Control. 2007;13:1487-1503.Edit
Strange Dynamics in a Fractional Derivative of Complex-Order Network of Chaotic Oscillators. International Journal of Bifurcation and Chaos. 2015;25:15550003.Edit
[2017-24] Stability of a heteroclinic network and its cycles: a case study from Boussinesq convection .Edit
[2017-36] A pair of rigid surfaces with p_g=q=2 and K^2=8 whose universal cover is not the bidisk .Edit
Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.Edit
Finitely generated synchronizing automata. In: Language and Automata Theory and Applications, LATA 2009. Vol LNCS, 5457.; 2009. 6. p. 672-683p. Edit
State complexity for code operators. International Journal of Foundations of Computer Science. 2011;22(7):1669-1681.Edit
State complexity of prefix, suffix, bifix and infix op- erators on regular languages. Vol LNCS, 6224 2010.Edit
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. In: Computability in Europe, CiE 2011. Vol LNCS, 6735.; 2011. 2. p. 230-238p. Edit