Abstract Finding a geodesic joining two given points in complete path-connected Riemannian manifold requires much more effort than determining from initial data. This is because it harder to solve boundary value problems problems. Shooting methods attempt by solving sequence of problems, and usually need good guess succeed. The present paper finds $$\gamma :[0,1]\rightarrow M$$ <mml:math xmlns:...

Evliliğin sona ermesiyle evlilik birliğindeki malvarlığı değerlerinin hakkaniyete uygun biçimde paylaştırılması gerekmektedir. Malvarlığı orantılı paylaştırılabilmesi için, eşlerin mal rejimi erdiğinde talep edebileceği birtakım alacak hakları bulunmaktadır. Eşler, tasfiye aşamasında, kural olarak süresince edindikleri “edinilmiş mallarının” yarısı üzerinde hakkına sahiptir. Bu hak, artık değer...

The expansion of MOOCs (massive open online courses) is very much associated with instructors interested in the craft teaching, innovating, and experimenting different methods to improve expand students’ learning experience. Erasmus+ project MOONLITE has worked create cross-institutional scenarios new educational pathways for migrants refugees, devising, among other things, two Spanish language...

We have developed a versatile plasmid vector (pReco-sigma) for recombination studies. When linearized and introduced into the cells of interest, pReco-sigma allows the simultaneous determination of the relative frequencies of homologous recombination versus nonhomologous DNA-end joining (also termed end-to-end joining), the latter an example of illegitimate recombination processes. As a system ...

Let Qn be the n−dimensional binary hypercube, u1, u2 and u3 be distinct even vertices of Qn and v1, v2 and v3 be distinct odd vertices of Qn. We prove that if n ≥ 4, then there exist three paths in Qn, one joining u1 and v1, one joining u2 and u3 and one joining v2 and v3, such that every vertex ofQn belongs to exactly one of the paths.

With the rapid development of sequencing technologies, an increasing number of sequences are available for evolutionary tree reconstruction. Although neighbor joining is regarded as the most popular and fastest evolutionary tree reconstruction method [its time complexity is O(n(3)), where n is the number of sequences], it is not sufficiently fast to infer evolutionary trees containing more than...