Publications
How useful is your X in discerning pedigrees? Forensic Science International: Genetics Supplement Series. 2011;3.Edit
Exotic dynamics in networks of coupled rings of cells. International Journal of Bifurcation and Chaos. 2012;22:13.Edit
[2008-45] Rank function on Lagrangian Matroids .Edit
The role of synaptic transmission in a HIV model with memory. Appl. Math. Comput.. 2017;292:76-95.Edit
Modelling gait transition in two-legged animals. Commun. Nonlinear Sci. Numer. Simul.. 2011;16:4625-4631.Edit
Formulation and communication of evaluative forensic science expert opinion—A GHEP-ISFG contribution to the establishment of standards. Forensic Science International: Genetics. 2016;25:210-213.Edit
Comparative evaluation of alternative batteries of genetic markers to complement autosomal STRs in kinship investigations: Autosomal indels vs. X-chromosome STRs. International Journal of Legal Medicine. 2012;126:917-921.Edit
Likelihood ratios in kinship analysis: Contrasting kinship classes, not genealogies. Forensic Science International: Genetics. 2010;4:218-219.Edit
A review of power laws in real life phenomena. Commun. Nonlinear Sci. Numer. Simul.. 2012;17:3558-3578.Edit
Central pattern generators for bipedal locomotion. J. Math. Biol.. 2006;53:474-489.Edit
Assessing paternities with inconclusive STR results: the suitability of bi-allelic markers. Forensic Science International: Genetics. 2013;7(1):16-21.Edit
Mutation and mutation rates at y chromosome specific Short Tandem Repeat Polymorphisms (STRs): A reappraisal. Forensic Science International: Genetics. 2014;9:20-24.Edit
When the alleged father is a close relative of the real father: The utility of insertion/deletion polymorphisms. Forensic Science International: Genetics Supplement Series. 2011;3.Edit
Power Law and Entropy Analysis of Catastrophic Phenomena. Mathematical Problems in Engineering. 2013;2013:10.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
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
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