Biology:Alignment-free sequence analysis

From HandWiki
Short description: Methods in computational biology

In bioinformatics, alignment-free sequence analysis approaches to molecular sequence and structure data provide alternatives over alignment-based approaches.[1]

The emergence and need for the analysis of different types of data generated through biological research has given rise to the field of bioinformatics.[2] Molecular sequence and structure data of DNA, RNA, and proteins, gene expression profiles or microarray data, metabolic pathway data are some of the major types of data being analysed in bioinformatics. Among them sequence data is increasing at the exponential rate due to advent of next-generation sequencing technologies. Since the origin of bioinformatics, sequence analysis has remained the major area of research with wide range of applications in database searching, genome annotation, comparative genomics, molecular phylogeny and gene prediction. The pioneering approaches for sequence analysis were based on sequence alignment either global or local, pairwise or multiple sequence alignment.[3][4] Alignment-based approaches generally give excellent results when the sequences under study are closely related and can be reliably aligned, but when the sequences are divergent, a reliable alignment cannot be obtained and hence the applications of sequence alignment are limited. Another limitation of alignment-based approaches is their computational complexity and are time-consuming and thus, are limited when dealing with large-scale sequence data.[5] The advent of next-generation sequencing technologies has resulted in generation of voluminous sequencing data. The size of this sequence data poses challenges on alignment-based algorithms in their assembly, annotation and comparative studies.

Alignment-free methods

Alignment-free methods can broadly be classified into five categories: a) methods based on k-mer/word frequency, b) methods based on the length of common substrings, c) methods based on the number of (spaced) word matches, d) methods based on micro-alignments, e) methods based on information theory and f) methods based on graphical representation. Alignment-free approaches have been used in sequence similarity searches,[6] clustering and classification of sequences,[7] and more recently in phylogenetics[8][9] (Figure 1).

Such molecular phylogeny analyses employing alignment-free approaches are said to be part of next-generation phylogenomics.[9] A number of review articles provide in-depth review of alignment-free methods in sequence analysis.[1][10][11][12][13][14][15]

The AFproject is an international collaboration to benchmark and compare software tools for alignment-free sequence comparison.[16]

Methods based on k-mer/word frequency

The popular methods based on k-mer/word frequencies include feature frequency profile (FFP),[17][18] Composition vector (CV),[19][20] Return time distribution (RTD),[21] frequency chaos game representation (FCGR).[22] and Spaced Words.[23]

Feature frequency profile (FFP)

The methodology involved in FFP based method starts by calculating the count of each possible k-mer (possible number of k-mers for nucleotide sequence: 4k, while that for protein sequence: 20k) in sequences. Each k-mer count in each sequence is then normalized by dividing it by total of all k-mers' count in that sequence. This leads to conversion of each sequence into its feature frequency profile. The pair wise distance between two sequences is then calculated Jensen–Shannon (JS) divergence between their respective FFPs. The distance matrix thus obtained can be used to construct phylogenetic tree using clustering algorithms like neighbor-joining, UPGMA etc.

Composition vector (CV)

In this method frequency of appearance of each possible k-mer in a given sequence is calculated. The next characteristic step of this method is the subtraction of random background of these frequencies using Markov model to reduce the influence of random neutral mutations to highlight the role of selective evolution. The normalized frequencies are put a fixed order to form the composition vector (CV) of a given sequence. Cosine distance function is then used to compute pairwise distance between CVs of sequences. The distance matrix thus obtained can be used to construct phylogenetic tree using clustering algorithms like neighbor-joining, UPGMA etc. This method can be extended through resort to efficient pattern matching algorithms to include in the computation of the composition vectors: (i) all k-mers for any value of k, (ii) all substrings of any length up to an arbitrarily set maximum k value, (iii) all maximal substrings, where a substring is maximal if extending it by any character would cause a decrease in its occurrence count.[24][25]

Return time distribution (RTD)

The RTD based method does not calculate the count of k-mers in sequences, instead it computes the time required for the reappearance of k-mers. The time refers to the number of residues in successive appearance of particular k-mer. Thus the occurrence of each k-mer in a sequence is calculated in the form of RTD, which is then summarised using two statistical parameters mean (μ) and standard deviation (σ). Thus each sequence is represented in the form of numeric vector of size 2⋅4k containing μ and σ of 4k RTDs. The pair wise distance between sequences is calculated using Euclidean distance measure. The distance matrix thus obtained can be used to construct phylogenetic tree using clustering algorithms like neighbor-joining, UPGMA etc. A recent approach Pattern Extraction through Entropy Retrieval (PEER) provides direct detection of the k-mer length and summarised the occurrence interval using entropy.

Frequency chaos game representation (FCGR)

The FCGR methods have evolved from chaos game representation (CGR) technique, which provides scale independent representation for genomic sequences.[26] The CGRs can be divided by grid lines where each grid square denotes the occurrence of oligonucleotides of a specific length in the sequence. Such representation of CGRs is termed as Frequency Chaos Game Representation (FCGR). This leads to representation of each sequence into FCGR. The pair wise distance between FCGRs of sequences can be calculated using the Pearson distance, the Hamming distance or the Euclidean distance.[27]

Spaced-word frequencies

While most alignment-free algorithms compare the word-composition of sequences, Spaced Words uses a pattern of care and don't care positions. The occurrence of a spaced word in a sequence is then defined by the characters at the match positions only, while the characters at the don't care positions are ignored. Instead of comparing the frequencies of contiguous words in the input sequences, this approach compares the frequencies of the spaced words according to the pre-defined pattern.[23] Note that the pre-defined pattern can be selected by analysis of the Variance of the number of matches,[28] the probability of the first occurrence on several models,[29] or the Pearson correlation coefficient between the expected word frequency and the true alignment distance.[30]

Methods based on length of common substrings

The methods in this category employ the similarity and differences of substrings in a pair of sequences. These algorithms were mostly used for string processing in computer science.[31]

Average common substring (ACS)

In this approach, for a chosen pair of sequences (A and B of lengths n and m respectively), longest substring starting at some position is identified in one sequence (A) which exactly matches in the other sequence (B) at any position. In this way, lengths of longest substrings starting at different positions in sequence A and having exact matches at some positions in sequence B are calculated. All these lengths are averaged to derive a measure [math]\displaystyle{ L(A, B) }[/math]. Intuitively, larger the [math]\displaystyle{ L(A, B) }[/math], the more similar the two sequences are. To account for the differences in the length of sequences, [math]\displaystyle{ L(A, B) }[/math] is normalized [i.e. [math]\displaystyle{ L(A, B)/\log(m) }[/math]]. This gives the similarity measure between the sequences.

In order to derive a distance measure, the inverse of similarity measure is taken and a correction term is subtracted from it to assure that [math]\displaystyle{ d(A, A) }[/math] will be zero. Thus

[math]\displaystyle{ d(A, B) = \left [ \frac{\log m}{L(A, B)} \right] - \left[\frac{\log n}{L(A, A)} \right]. }[/math]

This measure [math]\displaystyle{ d(A, B) }[/math] is not symmetric, so one has to compute [math]\displaystyle{ d_s(A, B) = d_s(B, A) = (d(A, B) + d(B, A))/2 }[/math], which gives final ACS measure between the two strings (A and B).[32] The subsequence/substring search can be efficiently performed by using suffix trees.[33][34][35]

k-mismatch average common substring approach (kmacs)

This approach is a generalization of the ACS approach. To define the distance between two DNA or protein sequences, kmacs estimates for each position i of the first sequence the longest substring starting at i and matching a substring of the second sequence with up to k mismatches. It defines the average of these values as a measure of similarity between the sequences and turns this into a symmetric distance measure. Kmacs does not compute exact k-mismatch substrings, since this would be computational too costly, but approximates such substrings.[36]

Mutation distances (Kr)

This approach is closely related to the ACS, which calculates the number of substitutions per site between two DNA sequences using the shortest absent substring (termed as shustring).[37]

Length distribution of k-mismatch common substrings

This approach uses the program kmacs[36] to calculate longest common substrings with up to k mismatches for a pair of DNA sequences. The phylogenetic distance between the sequences can then be estimated from a local maximum in the length distribution of the k-mismatch common substrings.[38]

Methods based on the number of (spaced) word matches

[math]\displaystyle{ D_2^S }[/math] and [math]\displaystyle{ D_2^* }[/math]

These approachese are variants of the [math]\displaystyle{ D_2 }[/math] statistics that counts the number of [math]\displaystyle{ k }[/math]-mer matches between two sequences. They improve the simple [math]\displaystyle{ D_2 }[/math] statistics by taking the background distribution of the compared sequences into account.[39]

MASH

This is an extremely fast method that uses the MinHash bottom sketch strategy for estimating the Jaccard index of the multi-sets of [math]\displaystyle{ k }[/math]-mers of two input sequences. That is, it estimates the ratio of [math]\displaystyle{ k }[/math]-mer matches to the total number of [math]\displaystyle{ k }[/math]-mers of the sequences. This can be used, in turn, to estimate the evolutionary distances between the compared sequences, measured as the number of substitutions per sequence position since the sequences evolved from their last common ancestor.[40]

Slope-Tree

This approach calculates a distance value between two protein sequences based on the decay of the number of [math]\displaystyle{ k }[/math]-mer matches if [math]\displaystyle{ k }[/math] increases.[41]

Slope-SpaM

This method calculates the number [math]\displaystyle{ N_k }[/math] of [math]\displaystyle{ k }[/math]-mer or spaced-word matches (SpaM) for different values for the word length or number of match positions [math]\displaystyle{ k }[/math] in the underlying pattern, respectively. The slope of an affine-linear function [math]\displaystyle{ F }[/math] that depends on [math]\displaystyle{ N_k }[/math] is calculated to estimate the Jukes-Cantor distance between the input sequences .[42]

Skmer

Skmer calculates distances between species from unassembled sequencing reads. Similar to MASH, it uses the Jaccard index on the sets of [math]\displaystyle{ k }[/math]-mers from the input sequences. In contrast to MASH, the program is still accurate for low sequencing coverage, so it can be used for genome skimming.[43]

Methods based on micro-alignments

Strictly spoken, these methods are not alignment-free. They are using simple gap-free micro-alignments where sequences are required to match at certain pre-defined positions. The positions aligned at the remaining positions of the micro-alignments where mismatches are allowed, are then used for phylogeny inference.

Co-phylog

This method searches for so-called structures that are defined as pairs of k-mer matches between two DNA sequences that are one position apart in both sequences. The two k-mer matches are called the context, the position between them is called the object. Co-phylog then defines the distance between two sequences the fraction of such structures for which the two nucleotides in the object are different. The approach can be applied to unassembled sequencing reads.[44]

andi

andi estimates phylogenetic distances between genomic sequences based on ungapped local alignments that are flanked by maximal exact word matches. Such word matches can be efficiently found using suffix arrays. The gapfree alignments between the exact word matches are then used to estimate phylogenetic distances between genome sequences. The resulting distance estimates are accurate for up to around 0.6 substitutions per position.[45]

Filtered Spaced-Word Matches (FSWM)

FSWM uses a pre-defined binary pattern P representing so-called match positions and don't-care positions. For a pair of input DNA sequences, it then searches for spaced-word matches w.r.t. P, i.e. for local gap-free alignments with matching nucleotides at the match positions of P and possible mismatches at the don't-care positions. Spurious low-scoring spaced-word matches are discarded, evolutionary distances between the input sequences are estimated based on the nucleotides aligned to each other at the don't-care positions of the remaining, homologous spaced-word matches.[46] FSWM has been adapted to estimate distances based on unassembled NGS reads, this version of the program is called Read-SpaM.[47]

Prot-SpaM

Prot-SpaM (Proteome-based Spaced-word Matches) is an implementation of the FSWM algorithm for partial or whole proteome sequences.[48]

Multi-SpaM

Multi-SpaM (MultipleSpaced-word Matches) is an approach to genome-based phylogeny reconstruction that extends the FSWM idea to multiple sequence comparison.[49] Given a binary pattern P of match positions and don't-care positions, the program searches for P-blocks, i.e. local gap-free four-way alignments with matching nucleotides at the match positions of P and possible mismatches at the don't-care positions. Such four-way alignments are randomly sampled from a set of input genome sequences. For each P-block, an unrooted tree topology is calculated using RAxML.[50] The program Quartet MaxCut is then used to calculate a supertree from these trees.

Methods based on information theory

Information Theory has provided successful methods for alignment-free sequence analysis and comparison. The existing applications of information theory include global and local characterization of DNA, RNA and proteins, estimating genome entropy to motif and region classification. It also holds promise in gene mapping, next-generation sequencing analysis and metagenomics.[51]

Base–base correlation (BBC)

Base–base correlation (BBC) converts the genome sequence into a unique 16-dimensional numeric vector using the following equation,

[math]\displaystyle{ T_{ij}(K) = \sum_{\ell=1}^K P_{ij}(\ell) \cdot \log_2 \left ( \frac{P_{ij}(\ell)}{P_i P_j} \right) }[/math]

The [math]\displaystyle{ P_i }[/math] and [math]\displaystyle{ P_j }[/math] denotes the probabilities of bases i and j in the genome. The [math]\displaystyle{ P_{ij}(\ell) }[/math] indicates the probability of bases i and j at distance ℓ in the genome. The parameter K indicates the maximum distance between the bases i and j. The variation in the values of 16 parameters reflect variation in the genome content and length.[52][53][54]

Information correlation and partial information correlation (IC-PIC)

IC-PIC (information correlation and partial information correlation) based method employs the base correlation property of DNA sequence. IC and PIC were calculated using following formulas,

[math]\displaystyle{ IC_\ell = -2 \sum_i P_i \log_2 P_i + \sum_{ij} P_{ij} (\ell) \log_2 P_{ij} (\ell) }[/math]
[math]\displaystyle{ PIC_{ij} (\ell) = (P_{ij} (\ell) - P_i P_j (\ell))^2 }[/math]

The final vector is obtained as follows:

[math]\displaystyle{ V = {IC_\ell \over PIC_{ij} (\ell)} \text{ where } \ell \isin \left \{ \ell_0, \ell_0 + 1, \ldots, \ell_0 + n \right \}, }[/math]

which defines the range of distance between bases.[55]

The pairwise distance between sequences is calculated using Euclidean distance measure. The distance matrix thus obtained can be used to construct phylogenetic tree using clustering algorithms like neighbor-joining, UPGMA, etc..

Compression

Examples are effective approximations to Kolmogorov complexity, for example Lempel-Ziv complexity. In general compression-based methods use the mutual information between the sequences. This is expressed in conditional Kolmogorov complexity, that is, the length of the shortest self-delimiting program required to generate a string given the prior knowledge of the other string. This measure has a relation to measuring k-words in a sequence, as they can be easily used to generate the sequence. It is sometimes a computationally intensive method. The theoretic basis for the Kolmogorov complexity approach was laid by Bennett, Gacs, Li, Vitanyi, and Zurek (1998) by proposing the information distance.[56] The Kolmogorov complexity being incomputable it was approximated by compression algorithms. The better they compress the better they are. Li, Badger, Chen, Kwong,, Kearney, and Zhang (2001) used a non-optimal but normalized form of this approach,[57] and the optimal normalized form by Li, Chen, Li, Ma, and Vitanyi (2003) appeared in [58] and more extensively and proven by Cilibrasi and Vitanyi (2005) in.[59] Otu and Sayood (2003) used the Lempel-Ziv complexity method to construct five different distance measures for phylogenetic tree construction.[60]

Context modeling compression

In the context modeling complexity the next-symbol predictions, of one or more statistical models, are combined or competing to yield a prediction that is based on events recorded in the past. The algorithmic information content derived from each symbol prediction can be used to compute algorithmic information profiles with a time proportional to the length of the sequence. The process has been applied to DNA sequence analysis.[61]

Methods based on graphical representation

Iterated maps

The use of iterated maps for sequence analysis was first introduced by HJ Jefferey in 1990[26] when he proposed to apply the Chaos Game to map genomic sequences into a unit square. That report coined the procedure as Chaos Game Representation (CGR). However, only 3 years later this approach was first dismissed as a projection of a Markov transition table by N Goldman.[62] This objection was overruled by the end of that decade when the opposite was found to be the case – that CGR bijectively maps Markov transition is into a fractal, order-free (degree-free) representation.[63] The realization that iterated maps provide a bijective map between the symbolic space and numeric space led to the identification of a variety of alignment-free approaches to sequence comparison and characterization. These developments were reviewed in late 2013 by JS Almeida in.[64] A number of web apps such as https://github.com/usm/usm.github.com/wiki,[65] are available to demonstrate how to encode and compare arbitrary symbolic sequences in a manner that takes full advantage of modern MapReduce distribution developed for cloud computing.

Comparison of alignment based and alignment-free methods

Alignment-based methods Alignment-free methods
These methods assume that homologous regions are contiguous (with gaps) Does not assume such contiguity of homologous regions
Computes all possible pairwise comparisons of sequences; hence computationally expensive Based on occurrences of sub-sequences; composition; computationally inexpensive, can be memory-intensive
Well-established approach in phylogenomics Relatively recent and application in phylogenomics is limited; needs further testing for robustness and scalability
Requires substitution/evolutionary models Less dependent on substitution/evolutionary models
Sensitive to stochastic sequence variation, recombination, horizontal (or lateral) genetic transfer, rate heterogeneity and sequences of varied lengths, especially when similarity lies in the "twilight zone" Less sensitive to stochastic sequence variation, recombination, horizontal (or lateral) genetic transfer, rate heterogeneity and sequences of varied lengths
Best practice uses inference algorithms with complexity at least O(n2); less time-efficient Inference algorithms typically O(n2) or less; more time-efficient
Heuristic in nature; statistical significance of how alignment scores relate to homology is difficult to assess Exact solutions; statistical significance of the sequence distances (and degree of similarity) can be readily assessed
Relies on dynamic programming (computationally expensive) to find alignment that has optimal score. side-steps computational expensive dynamic programming by indexing word counts or positions in fractal space.[66]

Applications of alignment-free methods

List of web servers/software for alignment-free methods

Name Description Availability Reference
Protcomp Most Expressed Features scoring approach PROTCOMP [85]
kmacs k-mismatch average common substring approach kmacs [36]
Spaced words Spaced-word frequencies spaced-words [23]
Co-phylog assembly-free micro-alignment approach Co-phylog [44]
Prot-SpaM Proteome-based spaced-word matches Prot-SpaM [48]
FSWM Filtered Spaced-Word Matches FSWM [46]
FFP Feature frequency profile based phylogeny FFP [17]
CVTree Composition vector based server for phylogeny CVTree [86]
RTD Phylogeny Return time distribution based server for phylogeny RTD Phylogeny [21]
AGP A multimethods web server for alignment-free genome phylogeny AGP [87]
Alfy Alignment-free detection of local similarity among viral and bacterial genomes Alfy [8]
decaf+py DistancE Calculation using Alignment-Free methods in PYthon decaf+py [88]
Dengue Subtyper Genotyping of Dengue viruses based on RTD Dengue Subtyper [21]
WNV Typer Genotyping of West nile viruses based on RTD WNV Typer [77]
AllergenFP Allergenicity prediction by descriptor fingerprints AllergenFP [79]
kSNP v2 Alignment-Free SNP Discovery kSNP v2 [80]
d2Tools Comparison of Metatranscriptomic Samples Based on k-Tuple Frequencies d2Tools [89]
rush Recombination detection Using SHustrings rush [81]
smash Genomic rearrangements detection and visualisation smash [67]
Smash++ Finding and visualizing genomic rearrangements Smash++ [68]
GScompare Oligonucleotide-based fast clustering of bacterial genomes GScompare –
COMET Alignment-free subtyping of HIV-1, HIV-2 and HCV viral sequences COMET [78]
USM Fractal MapReduce decomposition of sequence alignment usm.github.io [65]
FALCON Alignment-free method to infer metagenomic composition of ancient DNA FALCON [73]
Kraken Taxonomic classification using exact k-mer matches Kraken 2 [74]
CLC Phylogenetic trees using reference-free k-mer based matching CLC Microbial Genome Module [90]
EAGLE An ultra-fast tool to find relative absent words in genomic data EAGLE2 [91]
AlcoR An extremely efficient method for identifying and visualizing low-complexity regions in genomic and proteomic sequences. AlcoR [84]

See also

References

  1. ↑ 1.0 1.1 "Alignment-free sequence comparison-a review". Bioinformatics 19 (4): 513–523. March 2003. doi:10.1093/bioinformatics/btg005. PMID 12611807. 
  2. ↑ "Bioinformatics. Introduction". The Yale Journal of Biology and Medicine 85 (3): 305–308. September 2012. PMID 23189382. 
  3. ↑ "The many faces of sequence alignment". Briefings in Bioinformatics 6 (1): 6–22. March 2005. doi:10.1093/bib/6.1.6. PMID 15826353. 
  4. ↑ "Pairwise sequence alignment--it's all about us!". Briefings in Bioinformatics 7 (1): 113–115. March 2006. doi:10.1093/bib/bbk008. PMID 16761368. 
  5. ↑ "Upcoming challenges for multiple sequence alignment methods in the high-throughput era". Bioinformatics 25 (19): 2455–2465. October 2009. doi:10.1093/bioinformatics/btp452. PMID 19648142. 
  6. ↑ "Biological evaluation of d2, an algorithm for high-performance sequence comparison". Journal of Computational Biology 1 (3): 199–215. 1994. doi:10.1089/cmb.1994.1.199. PMID 8790465. 
  7. ↑ "A comprehensive approach to clustering of expressed human gene sequence: the sequence tag alignment and consensus knowledge base". Genome Research 9 (11): 1143–1155. November 1999. doi:10.1101/gr.9.11.1143. PMID 10568754. 
  8. ↑ 8.0 8.1 8.2 "Alignment-free detection of local similarity among viral and bacterial genomes". Bioinformatics 27 (11): 1466–1472. June 2011. doi:10.1093/bioinformatics/btr176. PMID 21471011. 
  9. ↑ 9.0 9.1 9.2 "Next-generation phylogenomics". Biology Direct 8: 3. January 2013. doi:10.1186/1745-6150-8-3. PMID 23339707. 
  10. ↑ "New developments of alignment-free sequence comparison: measures, statistics and next-generation sequencing". Briefings in Bioinformatics 15 (3): 343–353. May 2014. doi:10.1093/bib/bbt067. PMID 24064230. 
  11. ↑ 11.0 11.1 "Alignment-free phylogenetics and population genetics". Briefings in Bioinformatics 15 (3): 407–418. May 2014. doi:10.1093/bib/bbt083. PMID 24291823. 
  12. ↑ "Alignment-free genetic sequence comparisons: a review of recent approaches by word analysis". Briefings in Bioinformatics 15 (6): 890–905. November 2014. doi:10.1093/bib/bbt052. PMID 23904502. 
  13. ↑ "Alignment-free sequence comparison: benefits, applications, and tools". Genome Biology 18 (1): 186. October 2017. doi:10.1186/s13059-017-1319-7. PMID 28974235. 
  14. ↑ 14.0 14.1 "Alignment-free inference of hierarchical and reticulate phylogenomic relationships". Briefings in Bioinformatics 20 (2): 426–435. March 2019. doi:10.1093/bib/bbx067. PMID 28673025. 
  15. ↑ "Alignment-Free Sequence Analysis and Applications". Annual Review of Biomedical Data Science 1: 93–114. July 2018. doi:10.1146/annurev-biodatasci-080917-013431. PMID 31828235. Bibcode: 2018arXiv180309727R. 
  16. ↑ "Benchmarking of alignment-free sequence comparison methods". Genome Biology 20 (1): 144. July 2019. doi:10.1186/s13059-019-1755-7. PMID 31345254. 
  17. ↑ 17.0 17.1 "Whole-genome phylogeny of mammals: evolutionary information in genic and nongenic regions". Proceedings of the National Academy of Sciences of the United States of America 106 (40): 17077–17082. October 2009. doi:10.1073/pnas.0909377106. PMID 19805074. Bibcode: 2009PNAS..10617077S. 
  18. ↑ "Whole-genome phylogeny of Escherichia coli/Shigella group by feature frequency profiles (FFPs)". Proceedings of the National Academy of Sciences of the United States of America 108 (20): 8329–8334. May 2011. doi:10.1073/pnas.1105168108. PMID 21536867. Bibcode: 2011PNAS..108.8329S. 
  19. ↑ "Whole genome molecular phylogeny of large dsDNA viruses using composition vector method". BMC Evolutionary Biology 7 (1): 41. March 2007. doi:10.1186/1471-2148-7-41. PMID 17359548. Bibcode: 2007BMCEE...7...41G. 
  20. ↑ "A fungal phylogeny based on 82 complete genomes using the composition vector method". BMC Evolutionary Biology 9 (1): 195. August 2009. doi:10.1186/1471-2148-9-195. PMID 19664262. Bibcode: 2009BMCEE...9..195W. 
  21. ↑ 21.0 21.1 21.2 21.3 "Alignment-free distance measure based on return time distribution for sequence analysis: applications to clustering, molecular phylogeny and subtyping". Molecular Phylogenetics and Evolution 65 (2): 510–522. November 2012. doi:10.1016/j.ympev.2012.07.003. PMID 22820020. 
  22. ↑ "A phylogenetic analysis of the brassicales clade based on an alignment-free sequence comparison method". Frontiers in Plant Science 3: 192. 2012. doi:10.3389/fpls.2012.00192. PMID 22952468. 
  23. ↑ 23.0 23.1 23.2 "Fast alignment-free sequence comparison using spaced-word frequencies". Bioinformatics 30 (14): 1991–1999. July 2014. doi:10.1093/bioinformatics/btu177. PMID 24700317. 
  24. ↑ "Fast algorithms for computing sequence distances by exhaustive substring composition". Algorithms for Molecular Biology 3: 13. October 2008. doi:10.1186/1748-7188-3-13. PMID 18957094. 
  25. ↑ "Efficient tools for comparative substring analysis". Journal of Biotechnology 149 (3): 120–126. September 2010. doi:10.1016/j.jbiotec.2010.05.006. PMID 20682467. 
  26. ↑ 26.0 26.1 "Chaos game representation of gene structure". Nucleic Acids Research 18 (8): 2163–2170. April 1990. doi:10.1093/nar/18.8.2163. PMID 2336393. 
  27. ↑ "The spectrum of genomic signatures: from dinucleotides to chaos game representation". Gene 346: 173–185. February 2005. doi:10.1016/j.gene.2004.10.021. PMID 15716010. 
  28. ↑ "rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison". PLOS Computational Biology 12 (10): e1005107. October 2016. doi:10.1371/journal.pcbi.1005107. PMID 27760124. Bibcode: 2016PLSCB..12E5107H. 
  29. ↑ "Best hits of 11110110111: model-free selection and parameter-free sensitivity calculation of spaced seeds". Algorithms for Molecular Biology 12 (1): 1. Feb 14, 2017. doi:10.1186/s13015-017-0092-1. PMID 28289437. 
  30. ↑ 30.0 30.1 "A coverage criterion for spaced seeds and its applications to support vector machine string kernels and k-mer distances". Journal of Computational Biology 21 (12): 947–963. December 2014. doi:10.1089/cmb.2014.0173. PMID 25393923. Bibcode: 2014arXiv1412.2587N. 
  31. ↑ Algorithms on strings, trees, and sequences: computer science and computational biology (Reprinted (with corr.) ed.). Cambridge [u.a.]: Cambridge Univ. Press. 1997. ISBN 9780521585194. 
  32. ↑ "The average common substring approach to phylogenomic reconstruction". Journal of Computational Biology 13 (2): 336–350. March 2006. doi:10.1089/cmb.2006.13.336. PMID 16597244. 
  33. ↑ "Linear pattern matching algorithms". 14th Annual Symposium on Switching and Automata Theory (swat 1973). 1973. pp. 1–11. doi:10.1109/SWAT.1973.13. 
  34. ↑ "Using suffix tree to discover complex repetitive patterns in DNA sequences". 2006 International Conference of the IEEE Engineering in Medicine and Biology Society. 1. 2006. pp. 3474–7. doi:10.1109/IEMBS.2006.260445. ISBN 978-1-4244-0032-4. 
  35. ↑ "Compressed suffix tree--a basis for genome-scale sequence analysis". Bioinformatics 23 (5): 629–630. March 2007. doi:10.1093/bioinformatics/btl681. PMID 17237063. 
  36. ↑ 36.0 36.1 36.2 "Kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison". Bioinformatics 30 (14): 2000–2008. July 2014. doi:10.1093/bioinformatics/btu331. PMID 24828656. 
  37. ↑ "Estimating mutation distances from unaligned genomes". Journal of Computational Biology 16 (10): 1487–1500. October 2009. doi:10.1089/cmb.2009.0106. PMID 19803738. 
  38. ↑ "Phylogeny reconstruction based on the length distribution of k-mismatch common substrings". Algorithms for Molecular Biology 12: 27. 2017. doi:10.1186/s13015-017-0118-8. PMID 29238399. 
  39. ↑ "Alignment-free sequence comparison (I): statistics and power". Journal of Computational Biology 16 (12): 1615–1634. December 2009. doi:10.1089/cmb.2009.0198. PMID 20001252. 
  40. ↑ "Mash: fast genome and metagenome distance estimation using MinHash". Genome Biology 17 (1): 132. June 2016. doi:10.1186/s13059-016-0997-x. PMID 27323842. 
  41. ↑ "Phylogeny Reconstruction with Alignment-Free Method That Corrects for Horizontal Gene Transfer". PLOS Computational Biology 12 (6): e1004985. June 2016. doi:10.1371/journal.pcbi.1004985. PMID 27336403. Bibcode: 2016PLSCB..12E4985B. 
  42. ↑ "The number of k-mer matches between two DNA sequences as a function of k and applications to estimate phylogenetic distances". PLOS ONE 15 (2): e0228070. 2020. doi:10.1371/journal.pone.0228070. PMID 32040534. Bibcode: 2020PLoSO..1528070R. 
  43. ↑ "Skmer: assembly-free and alignment-free sample identification using genome skims". Genome Biology 20 (1): 34. February 2019. doi:10.1186/s13059-019-1632-4. PMID 30760303. 
  44. ↑ 44.0 44.1 "Co-phylog: an assembly-free phylogenomic approach for closely related organisms". Nucleic Acids Research 41 (7): e75. April 2013. doi:10.1093/nar/gkt003. PMID 23335788. 
  45. ↑ "andi: fast and accurate estimation of evolutionary distances between closely related genomes". Bioinformatics 31 (8): 1169–1175. April 2015. doi:10.1093/bioinformatics/btu815. PMID 25504847. 
  46. ↑ 46.0 46.1 "Fast and accurate phylogeny reconstruction using filtered spaced-word matches". Bioinformatics 33 (7): 971–979. April 2017. doi:10.1093/bioinformatics/btw776. PMID 28073754. 
  47. ↑ "Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage". BMC Bioinformatics 20 (Suppl 20): 638. December 2019. doi:10.1186/s12859-019-3205-7. PMID 31842735. 
  48. ↑ 48.0 48.1 "Prot-SpaM: fast alignment-free phylogeny reconstruction based on whole-proteome sequences". GigaScience 8 (3): giy148. March 2019. doi:10.1093/gigascience/giy148. PMID 30535314. 
  49. ↑ "'Multi-SpaM': a maximum-likelihood approach to phylogeny reconstruction using multiple spaced-word matches and quartet trees". NAR Genomics and Bioinformatics 2 (1): lqz013. March 2020. doi:10.1093/nargab/lqz013. PMID 33575565. 
  50. ↑ "RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models". Bioinformatics 22 (21): 2688–2690. November 2006. doi:10.1093/bioinformatics/btl446. PMID 16928733. 
  51. ↑ "Information theory applications for biological sequence analysis". Briefings in Bioinformatics 15 (3): 376–389. May 2014. doi:10.1093/bib/bbt068. PMID 24058049. 
  52. ↑ "A novel feature-based method for whole genome phylogenetic analysis without alignment: application to HEV genotyping and subtyping". Biochemical and Biophysical Research Communications 368 (2): 223–230. April 2008. doi:10.1016/j.bbrc.2008.01.070. PMID 18230342. 
  53. ↑ "Coronavirus phylogeny based on base-base correlation". International Journal of Bioinformatics Research and Applications 4 (2): 211–220. 2008. doi:10.1504/ijbra.2008.018347. PMID 18490264. 
  54. ↑ "CGAP: a new comprehensive platform for the comparative analysis of chloroplast genomes". BMC Bioinformatics 14: 95. March 2013. doi:10.1186/1471-2105-14-95. PMID 23496817. 
  55. ↑ "Genome-based phylogeny of dsDNA viruses by a novel alignment-free method". Gene 492 (1): 309–314. January 2012. doi:10.1016/j.gene.2011.11.004. PMID 22100880. 
  56. ↑ Bennett, C.H., Gacs, P., Li, M., Vitanyi, P. and Zurek, W., Information distance, IEEE Trans. Inform. Theory, 44, 1407--1423
  57. ↑ Li, M., Badger, J.H., Chen, X., Kwong, S., Kearney, P. and Zhang, H., (2001) An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics, 17:(2001), 149--154
  58. ↑ M. Li, X. Chen, X. Li, B. Ma, P.M.B. Vitanyi. The similarity metric, IEEE Trans. Inform. Th., 50:12(2004), 3250--3264
  59. ↑ R.L. Cilibrasi and P.M.B. Vitanyi, Clustering by compression, IEEE Trans. Informat. Th., 51:4(2005), 1523--1545
  60. ↑ "A new sequence distance measure for phylogenetic tree construction". Bioinformatics 19 (16): 2122–2130. November 2003. doi:10.1093/bioinformatics/btg295. PMID 14594718. 
  61. ↑ "DNA sequences at a glance". PLOS ONE 8 (11): e79922. Nov 21, 2013. doi:10.1371/journal.pone.0079922. PMID 24278218. Bibcode: 2013PLoSO...879922P. 
  62. ↑ "Nucleotide, dinucleotide and trinucleotide frequencies explain patterns observed in chaos game representations of DNA sequences". Nucleic Acids Research 21 (10): 2487–2491. May 1993. doi:10.1093/nar/21.10.2487. PMID 8506142. 
  63. ↑ "Analysis of genomic sequences by Chaos Game Representation". Bioinformatics 17 (5): 429–437. May 2001. doi:10.1093/bioinformatics/17.5.429. PMID 11331237. 
  64. ↑ "Sequence analysis by iterated maps, a review". Briefings in Bioinformatics 15 (3): 369–375. May 2014. doi:10.1093/bib/bbt072. PMID 24162172. 
  65. ↑ 65.0 65.1 "Fractal MapReduce decomposition of sequence alignment". Algorithms for Molecular Biology 7 (1): 12. May 2012. doi:10.1186/1748-7188-7-12. PMID 22551205. 
  66. ↑ "Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis". Algorithms for Molecular Biology 7 (1): 10. May 2012. doi:10.1186/1748-7188-7-10. PMID 22551152. 
  67. ↑ 67.0 67.1 "An alignment-free method to find and visualise rearrangements between pairs of DNA sequences". Scientific Reports 5 (10203): 10203. May 2015. doi:10.1038/srep10203. PMID 25984837. Bibcode: 2015NatSR...510203P. 
  68. ↑ 68.0 68.1 "Smash++: an alignment-free and memory-efficient tool to find genomic rearrangements". GigaScience 9 (5): giaa048. May 2020. doi:10.1093/gigascience/giaa048. PMID 32432328. 
  69. ↑ "k-mer Similarity, Networks of Microbial Genomes, and Taxonomic Rank". mSystems 3 (6): e00257–18. Nov 20, 2018. doi:10.1128/mSystems.00257-18. PMID 30505941. 
  70. ↑ 70.0 70.1 "New developments of alignment-free sequence comparison: measures, statistics and next-generation sequencing". Briefings in Bioinformatics 15 (3): 343–353. May 2014. doi:10.1093/bib/bbt067. PMID 24064230. 
  71. ↑ "Spaced seeds improve k-mer-based metagenomic classification". Bioinformatics 31 (22): 3584–3592. November 2015. doi:10.1093/bioinformatics/btv419. PMID 26209798. Bibcode: 2015arXiv150206256B. 
  72. ↑ "Higher classification sensitivity of short metagenomic reads with CLARK-S". Bioinformatics 32 (24): 3823–3825. December 2016. doi:10.1093/bioinformatics/btw542. PMID 27540266. 
  73. ↑ 73.0 73.1 Pratas D, Pinho AJ, Silva RM, Rodrigues JM, Hosseini M, Caetano T, Ferreira PJ (February 2018). "FALCON: a method to infer metagenomic composition of ancient DNA". bioRxiv 10.1101/267179.
  74. ↑ 74.0 74.1 "Kraken: ultrafast metagenomic sequence classification using exact alignments". Genome Biology 15 (3): R46. March 2014. doi:10.1186/gb-2014-15-3-r46. PMID 24580807. 
  75. ↑ "Applications of alignment-free methods in epigenomics". Briefings in Bioinformatics 15 (3): 419–430. May 2014. doi:10.1093/bib/bbt078. PMID 24197932. 
  76. ↑ "Alignment-free analysis of barcode sequences by means of compression-based methods". BMC Bioinformatics 14 (Suppl 7): S4. 2013. doi:10.1186/1471-2105-14-S7-S4. PMID 23815444. 
  77. ↑ 77.0 77.1 "WNV Typer: a server for genotyping of West Nile viruses using an alignment-free method based on a return time distribution". Journal of Virological Methods 198: 41–55. March 2014. doi:10.1016/j.jviromet.2013.12.012. PMID 24388930. 
  78. ↑ 78.0 78.1 "COMET: adaptive context-based modeling for ultrafast HIV-1 subtype identification". Nucleic Acids Research 42 (18): e144. October 2014. doi:10.1093/nar/gku739. PMID 25120265. 
  79. ↑ 79.0 79.1 "AllergenFP: allergenicity prediction by descriptor fingerprints". Bioinformatics 30 (6): 846–851. March 2014. doi:10.1093/bioinformatics/btt619. PMID 24167156. 
  80. ↑ 80.0 80.1 "When whole-genome alignments just won't work: kSNP v2 software for alignment-free SNP discovery and phylogenetics of hundreds of microbial genomes". PLOS ONE 8 (12): e81760. Dec 9, 2013. doi:10.1371/journal.pone.0081760. PMID 24349125. Bibcode: 2013PLoSO...881760G. 
  81. ↑ 81.0 81.1 "An alignment-free test for recombination". Bioinformatics 29 (24): 3121–3127. December 2013. doi:10.1093/bioinformatics/btt550. PMID 24064419. 
  82. ↑ "The complexity landscape of viral genomes". GigaScience 11: 1–16. August 2022. doi:10.1093/gigascience/giac079. PMID 35950839. 
  83. ↑ "Feature-Based Classification of Archaeal Sequences Using Compression-Based Methods" (in en), Pattern Recognition and Image Analysis, Lecture Notes in Computer Science (Cham: Springer International Publishing) 13256: pp. 309–320, 2022, doi:10.1007/978-3-031-04881-4_25, ISBN 978-3-031-04880-7, https://link.springer.com/10.1007/978-3-031-04881-4_25, retrieved 2022-08-31 
  84. ↑ 84.0 84.1 "AlcoR: alignment-free simulation, mapping, and visualization of low-complexity regions in biological data". GigaScience 12. December 2022. doi:10.1093/gigascience/giad101. PMID 38091509. 
  85. ↑ "ARISE: Artificial Intelligence Semantic Search Engine". WIVACE2021. 
  86. ↑ "CVTree update: a newly designed phylogenetic study platform using composition vectors and whole genomes". Nucleic Acids Research 37 (Web Server issue): W174–W178. July 2009. doi:10.1093/nar/gkp278. PMID 19398429. 
  87. ↑ "AGP: a multimethods web server for alignment-free genome phylogeny". Molecular Biology and Evolution 30 (5): 1032–1037. May 2013. doi:10.1093/molbev/mst021. PMID 23389766. 
  88. ↑ "Pattern-based phylogenetic distance estimation and tree reconstruction". Evolutionary Bioinformatics Online 2: 359–375. February 2007. PMID 19455227. Bibcode: 2006q.bio.....5002H. 
  89. ↑ "Comparison of metatranscriptomic samples based on k-tuple frequencies". PLOS ONE 9 (1): e84348. Jan 2, 2014. doi:10.1371/journal.pone.0084348. PMID 24392128. Bibcode: 2014PLoSO...984348W. 
  90. ↑ "CLC Microbial Genomics Module". 2019. https://www.qiagenbioinformatics.com/products/clc-microbial-genomics-module/. 
  91. ↑ "Persistent minimal sequences of SARS-CoV-2". Bioinformatics 36 (21): 5129–5132. January 2021. doi:10.1093/bioinformatics/btaa686. PMID 32730589. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Biology:Alignment-free_sequence_analysis&oldid=3657429"