Search results
Jump to navigation
Jump to search
- {{Short description|Software for sequence alignment}} ...s substantial improvement of DIALIGN-T by combining greedy and progressive alignment strategies in a new algorithm. ...2 KB (201 words) - 21:55, 3 January 2024
- '''MaMF''', or Mammalian Motif Finder, is an algorithm for identifying [[Sequence motif|motifs]] to which [[transcription factors]] bind.<ref>{{cite journal ...res an [[n-mer]], and each sequence forms an ungapped [[Sequence alignment|alignment]] with a substring of length w from the string of length 2w around the matc ...2 KB (281 words) - 10:05, 27 July 2023
- ...and occur only once in each genome are almost certainly part of the global alignment. ...orithms in Bioinformatics">{{cite book |last1=Wing-Kin |first1=Sung |title=Algorithms in Bioinformatics: A Practical Introduction |date=2010 |publisher=Chapman & ...7 KB (1,067 words) - 21:36, 31 March 2024
- '''MUMmer''' is a [[bioinformatics]] software system for [[sequence alignment]]. It is based on the [[suffix tree]] data structure. It has been used for The original algorithms in the MUMMER software package were designed by Art Delcher, Simon Kasif an ...8 KB (1,008 words) - 12:53, 25 May 2025
- ...achine learning]] software library written in [[C++]]. It offers numerous algorithms and data structures for [[machine learning]] problems. It offers interfaces ==Supported algorithms== ...5 KB (679 words) - 06:14, 16 February 2025
- ...th–Waterman alignment]] between a [[protein sequence]] and another protein sequence, a protein database, a [[DNA]] or a DNA library. ...parison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms |url=http://dx.doi.org/10.1016/0888-7543(91)90071-l |journal=Genomics |volu ...4 KB (526 words) - 04:07, 27 May 2025
- ...be either of [[genomic]], "[[transcriptome|transcriptomic]]" ([[expressed sequence tag|ESTs]]) or [[protein]] origin. ...o group sequences originating from the same [[gene]] before the ESTs are [[sequence assembly|assembled]] to reconstruct the original [[mRNA]]. ...10 KB (1,333 words) - 17:01, 18 July 2025
- ...tree is minimized. Tree alignment can be accomplished using one of several algorithms with various trade-offs between manageable tree size and computational effo ...last1=Elias | first1=Isaac | title=Settling the intractability of multiple alignment | doi=10.1089/cmb.2006.13.1323 | year=2006 | journal=J Comput Biol | volume ...16 KB (2,523 words) - 08:55, 27 May 2025
- ...10.1145/1824795.1824798 | title = A taxonomy of sequential pattern mining algorithms | journal = ACM Computing Surveys | volume = 43 | pages = 1–41 | year = 201 ...which is typically based on [[String (computer science)|string processing algorithms]] and ''itemset mining'' which is typically based on [[association rule le ...9 KB (1,233 words) - 19:42, 10 June 2025
- ...a [[dynamic programming]] [[algorithm]] that finds the optimal [[sequence alignment]] between two [[string (computer science)|string]]s. Optimality is measured ...length}(Y) = m</math>, the [[Needleman–Wunsch algorithm]] finds an optimal alignment in [[Big O Notation|<math>O(nm)</math>]] time, using <math>O(nm)</math> spa ...9 KB (1,289 words) - 15:06, 19 April 2025
- {{Short description|Sequence analysis in social science}} ...to study molecular biology (protein or genetic) sequences (see [[sequence alignment]]). Optimal matching uses the [[Needleman-Wunsch algorithm]]. ...5 KB (852 words) - 18:23, 19 May 2024
- {{Short description|DNA and protein sequence alignment software package}} '''FASTA''' is a [[DNA]] and [[protein]] [[sequence alignment]] software package first described by [[David J. Lipman]] and [[William Pea ...11 KB (1,667 words) - 18:53, 10 January 2025
- ...MAFFT contain software licensed under other licenses https://mafft.cbrc.jp/alignment/software/</ref> |website = {{URL|mafft.cbrc.jp/alignment/software}} ...18 KB (2,606 words) - 05:51, 23 February 2025
- ...achi|first2=I.|last3=Nakamura|first3=Y.|title=The International Nucleotide Sequence Database Collaboration|journal=Nucleic Acids Research|date=23 November 2010 ...the sequence database.<ref>{{cite book |last1=Sung |first1=Wing-Kin |title=Algorithms in bioinformatics : a practical introduction |date=2010 |publisher=Chapman ...10 KB (1,337 words) - 10:18, 18 November 2025
- | thesis_title = Aspects of Biological Sequence Comparison | title = Basic Local Alignment Search Tool ...7 KB (849 words) - 07:23, 19 July 2025
- ...cause an alignment to become meaningless. Gap penalties are used to adjust alignment scores based on the number and length of gaps. The five main types of gap p ...ce alignments, gaps are represented as dashes(-) on a protein/DNA sequence alignment.<ref name="rosalind_glossary" /> ...19 KB (2,793 words) - 15:17, 12 August 2025
- {{Short description|Pairwise sequence alignment algorithm}} ...)|BLAST]]-like alignment tool) is a [[sequence alignment|pairwise sequence alignment]] [[algorithm]] that was developed by [[Jim Kent]] at the [[University of C ...17 KB (2,616 words) - 12:00, 18 December 2023
- {{Short description|Software for sequence alignment}} | name = MUltiple Sequence Comparison by Log-Expectation ...20 KB (2,851 words) - 15:30, 4 June 2025
- The measurement paradigm is to assess degradations of a decoded video sequence output from the network (for example as received by a TV set top box) in co ...1 (bad) to 5 (excellent) and indicate the perceived quality of the decoded sequence. ...4 KB (518 words) - 15:47, 30 May 2025
- ...ip between the structures deposited in the PDB and the [[Primary structure|sequence]] of the protein which one wishes to model. ...te is selected, the structural model of the sequence is built based on the alignment with the chosen template. Protein threading is based on two basic observati ...15 KB (2,097 words) - 22:40, 5 September 2024