نتایج جستجو برای: gurson tevergaard needleman damage
تعداد نتایج: 226296 فیلتر نتایج به سال:
With the rise of high throughput sequencing, new programs have been developed for dealing with the alignment of a huge amount of short read data to reference genomes. Recent developments in sequencing technology allow longer reads, but the mappers for short reads are not suited for reads of several hundreds of base pairs. We propose an algorithm for mapping longer reads, which is based on chain...
Aluminum alloys have inherent tendencies to produce casting defects caused by alloying or metal melt flow inside the mold. The traditional detection method for these includes reduced pressure tests, which assess quality in a destructive manner. This leaves gap between assessments and tensile test correlations. Computed tomography (CT) scans offer crucial assistance evaluating internal of castin...
The rupture in metals can occur by cleavage, where all process is controlled stresses, or ductile fracture, which takes into account the damage caused nucleation and growth of voids.The then dependent on stresses strains. Linear Elastic Fracture Mechanics, widely used engineering practice, based assumption that first prevails, occurs only under certain conditions. Consideration second fracture ...
Sequence similarity algorithms are used to reconstruct increasing large evolutionary trees involving increasingly distant evolutionary relationships. This paper proposes two sequence similarity algorithms, called the Greedy Tiling and the Random Tiling algorithms, that are both based on the idea of tiling one sequence by parts of another sequence. Experimental comparisons show that the new algo...
We present an algorithm--a generalization of the Needleman-Wunsch-Sellers algorithm--which finds within longer sequences all subsequences that resemble one another locally. The probability that so close a resemblance would occur by chance alone is calculated and used to classify these local homologies according to statistical significance. Repeats and inverted repeats may also be found. Results...
We present a formulation of the Needleman /Wunsch type algorithm for sequence alignment in which the mutation matrix is allowed to vary under the control of a hidden Markov process. The fully trainable model is applied to two problems in bioinformatics: the recognition of related gene/protein names and the alignment and scoring of homologous proteins. Crown Copyright # 2002 Published by Elsevie...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید