Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Recognition of Conformational States of a G Protein-Coupled Receptor from Molecular Dynamic Simulations Using Sampling Techniques Read chapter Read first chapter

2023 | OriginalPaper | Chapter

An Algorithm for Pairwise DNA Sequences Alignment

Authors : Veska Gancheva, Hristo Stoev

Published in: Bioinformatics and Biomedical Engineering

Publisher: Springer Nature Switzerland

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A challenge in data analysis in bioinformatics is to offer integrated and modern access to the progressively increasing volume of data, as well as efficient algorithms for their processing. Considering the vast databases of biological data available, it is extremely important to develop efficient methods for processing biological data. A new algorithm for arranging DNA sequences based on the suggested CAT method is proposed, consisting of an algorithm for calculating a CAT profile against the selected reference sequences and an algorithm for comparing two sequences, based on the calculated CAT profiles. Implementation steps, inputs and outputs are defined. A software implementation of the proposed method for arranging biological sequences CAT has been designed and developed. Experiments have been carried out using different data sets to align DNA sequences based on CAT method. An analysis of the experimental results have been done in terms of collisions, speed and effectiveness of the proposed solutions.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Validation of Height-for-Age and BMI-for-Age Z-scores Assessment Using Android-Based Mobile Apps
next chapter Multiallelic Maximal Perfect Haplotype Blocks with Wildcards via PBWT
Literature
1.
Needleman, S., Wunsch, C.: A General method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443–453 (1970)CrossRefPubMed
2.
Smith, T., Waterman, M.: Identification of common molecular subsequences. J. Molecul. Biol. 147, 195–197 (1981)CrossRef
3.
Altschul, S., et al.: Basic local alignment search tool. J. Molecul. Biol. 215(3) 1990
4.
5.
Hoksza, D., Svozil, D.: Multiple 3D RNA structure superposition using neighbor joining. IEEE/ACM Trans. Comput. Biol. Bioinf. 12(3), 520–530 (2015)CrossRef
6.
Ebedes, J., Datta, A.: Multiple sequence alignment in parallel on a workstation cluster. Bioinformatics 20(7), 1193–1195 (2004)CrossRefPubMed
7.
Mikhailov, D., et al.: Performance optimization of ClustalW: parallel ClustalW, HT Clustal, and MULTICLUSTAL, White paper, 2001, Silicon Graphics, Mountain View, CA
8.
Thompson, J., Higgins, D., Gibson, T.: ClustalW: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 22(22), 4673–4680 (1994)CrossRefPubMedPubMedCentral
9.
Cheetham, J., et al.: Parallel ClustalW for PC clusters. In: Proceedings of International Conference on Computational Science and its Applications, Montreal, Canada (2003)
10.
Zhang, F., Qiao, X.Z., Liu, Z.Y.: A parallel Smith-Waterman algorithm based on divide and conquer. In: Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing ICA3PP 2002 (2002)
11.
Farrar, M.: Striped Smith-Waterman speeds database searches six times over other SIMD implementations. Bioinformatics 23(2), 156–161 (2007)
12.
Sharma, C., Agrawal, P., Gupta, P.: Multiple sequence alignments with parallel computing. In: Proceedings of IJCA International Conference Advantages in Computer Engineering Application ICACEA, no. 5, pp. 16–21, Mar. 2014
13.
Sathe, S.R., Shrimankar, D.D.: Parallelizing and analyzing the behavior of sequence alignment algorithm on a cluster of workstations for large datasets. Int. J. Comput. Appl. 74(21), 1–13 (2013)
14.
Borovska, P., Gancheva, V., Landzhev, N.: Massively parallel algorithm for multiple biological sequences alignment. In: Proceeding of 36th IEEE International Conference on Telecommunications and Signal Processing (TSP), pp. 638–642 (2013). 10.1109/ TSP.2013.6614014
15.
Metadata
Title
An Algorithm for Pairwise DNA Sequences Alignment
Authors
Veska Gancheva
Hristo Stoev
Copyright Year
2023
Book
Bioinformatics and Biomedical Engineering

Print ISBN: 978-3-031-34952-2

Electronic ISBN: 978-3-031-34953-9

Copyright Year: 2023

DOI
https://doi.org/10.1007/978-3-031-34953-9_4

Premium Partner

    Image Credits