Locally optimal subalignments using nonlinear similarity functions
From MaRDI portal
Publication:1090289
DOI10.1007/BF02462328zbMath0619.92020OpenAlexW4246917063WikidataQ52653375 ScholiaQ52653375MaRDI QIDQ1090289
Bruce W. Erickson, Stephen F. Altschul
Publication date: 1986
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02462328
algorithmsalgorithm CC-1general similarity costslocally optimal subalignmentsnonlinear similarity functionssequence subalignmentstime and storage complexities
Problems related to evolution (92D15) General biology and biomathematics (92B05) Other natural sciences (mathematical treatment) (92F05)
Related Items
A nonlinear measure of subalignment similarity and its significance levels ⋮ Optimized homology searches of the gene and protein sequence data banks ⋮ Significance levels for biological sequence comparison using non-linear similarity functions ⋮ APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS ⋮ A polyhedral approach to sequence alignment problems
Cites Work
- General methods of sequence comparison
- Pattern recognition in genetic sequences by mismatch density
- Optimal sequence alignment using affine gap costs
- A nonlinear measure of subalignment similarity and its significance levels
- Comparison of biosequences
- Some biological sequence metrics
- On the Theory and Computation of Evolutionary Distances
