background detection of fetal dna in maternal blood has been examined by many research groups for a few years; thereby, scientists have a shorter way to take to approach prenatal diagnosis of abnormal pregnancies. the y chromosome sequences have recently become the most common applicable indices for fetal sex determination. objectives we conducted an algorithmic x and y mini-short tandem repeat...

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

the aim of this paper is to improve the performance of the conventional goertzel algorithm in determining the protein codingregions in deoxyribonucleic acid (dna) sequences. first, the symbolic dna sequences are converted into numerical signals usingelectron ion interaction potential method. then by combining the modified anti-notch filter and linear predictive coding model,we proposed an effic...

the main purpose of this paper is to introduce afast method for gene prediction in dna sequences based on the period-3 property in exons. first, the symbolic dna sequences are converted to digital signal using the eiip method. then, to reduce the effect of background noise in the period-3 spectrum, we use the discrete wavelet transform (dwt) at three levels and apply it on the input digital sig...

today, optimal performance and cost advantages of using internet telephony are obvious. despite current standardized techniques, voice transferring through protocol (voip) has lower security than traditional telephony. one of the most important security issues which should be noticed in using voip is end -to-end user2 identity, i.e. when  there is a connection between user a and b, user a shoul...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...