US8223043B2 - Method and apparatus for compressing nucleotide sequence data - Google Patents

Method and apparatus for compressing nucleotide sequence data Download PDF

Info

Publication number
US8223043B2
US8223043B2 US12/977,457 US97745710A US8223043B2 US 8223043 B2 US8223043 B2 US 8223043B2 US 97745710 A US97745710 A US 97745710A US 8223043 B2 US8223043 B2 US 8223043B2
Authority
US
United States
Prior art keywords
sequence
reading
seed
seeds
common
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US12/977,457
Other languages
English (en)
Other versions
US20110163898A1 (en
Inventor
Bai-Kuang HWANG
Jenn-Yeh Fann
Chung-Fan Chiou
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Industrial Technology Research Institute ITRI
Original Assignee
Industrial Technology Research Institute ITRI
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Industrial Technology Research Institute ITRI filed Critical Industrial Technology Research Institute ITRI
Priority to US12/977,457 priority Critical patent/US8223043B2/en
Assigned to INDUSTRIAL TECHNOLOGY RESEARCH INSTITUTE reassignment INDUSTRIAL TECHNOLOGY RESEARCH INSTITUTE ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CHIOU, CHUNG-FAN, FANN, JENN-YEH, HWANG, BAI-KUANG
Publication of US20110163898A1 publication Critical patent/US20110163898A1/en
Application granted granted Critical
Publication of US8223043B2 publication Critical patent/US8223043B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B30/00—ICT specially adapted for sequence analysis involving nucleotides or amino acids
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B30/00—ICT specially adapted for sequence analysis involving nucleotides or amino acids
    • G16B30/10—Sequence alignment; Homology search
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B50/00—ICT programming tools or database systems specially adapted for bioinformatics
    • G16B50/50—Compression of genetic data

Definitions

  • the invention relates to methods and apparatuses, and in particular relates to methods and apparatuses for compressing nucleotide sequence data.
  • DNA segments are synthesized in multiple copies by way of using a designed primer and polymerase. Then the fluorescent signals are received by the sensors, identified by the algorithm and output the result A, C, G, and T.
  • the path of the starting sequencing signals to raw sequences in storage includes three stages: (1) sequencing signals to raw data, (2) raw data to raw sequence in data storage, (3) raw sequence to sequence in computer storage and vice versa.
  • personal computer communicates these data with its peripherals in a speed between 100 M bytes to some Giga bytes per second. The critical point in the path would be obviously in the interface between PC and its peripherals or devices.
  • the invention provides a data compression method, comprising: (a) obtaining a first reading sequence and a second reading sequence from an identical source by a receiving unit; (b) comparing the first reading sequence with the second reading sequence according to a comparison condition to generate a sequence comparison result by the processor; (c) outputting a final template sequence according to the sequence comparison result by the processor; (d) comparing the final template sequence to each of the first and second reading sequences, to generate a respective difference between the final template sequence and each of the first and second reading sequences by the processor; and (e) compressing the first and second reading sequences according to the final template sequences and all generated differences between the final template sequence and the first and second reading sequences, to generate a compression file by the processor, wherein the comparison condition is set according to a first seed table of the first reading sequence comprises a plurality of first seeds with a specific length constituting a plurality of first seed sets with different seeding start sites and a second seed table of the second reading sequence comprises a plurality of second seeds with
  • the invention provides a data compression method, comprising: (a) obtaining a plurality of reading sequences from an identical source by a receiving unit; (b) selecting one of the plurality of reading sequences as an initial template sequence by the processor; (c) comparing the initial template sequence to each of the other sequences according to a comparison condition, to respectively generate comparison results by the processor; (d) generating a sequence comparison result according to all respectively generated comparison results by the processor; (e) outputting a final template sequence according to the sequence comparison result by the processor; (f) comparing the final template sequence to each of the plurality of reading sequences, to generate a respective difference between the final template sequence and each of the plurality of reading sequences by the processor; and (g) compressing the plurality of reading sequences according to the final template sequences and all generated differences between the final template sequence and the plurality of reading sequences, to generate a compression file by the processor, wherein the comparison condition is set according to a first seed table of the initial template sequence comprises a plurality of first seeds with
  • the invention provides a sequence compression device, comprising: a receiving unit for obtaining a plurality of reading sequences from an identical source; and a processor for performing steps which comprise: (a) selecting one of the plurality of reading sequences as an initial template sequence; (b) comparing the initial template sequence to each of the other sequences according to a comparison condition, to respectively generate comparison results; (c) generating a sequence comparison result according to all respectively generated comparison results; (d) outputting a final template sequence according to the sequence comparison result; (e) comparing the final template sequence to each of the plurality of reading sequences, to generate a respective difference between the final template sequence and each of the plurality of reading sequences by the processor; and (f) compressing the plurality of reading sequences according to the final template sequences and all generated differences between the final template sequence and the plurality of reading sequences, to generate a compression file by the processor, wherein the comparison condition is set according to a first seed table of the initial template sequence comprises a plurality of first seeds with a specific length constitu
  • FIG. 1 shows a diagram of one embodiment of a sequence compression device of the invention
  • FIG. 2 a shows a simplified flow chart of one embodiment of a sequence compression method for two reading sequences
  • FIG. 2 b shows a simplified flow chart of one embodiment of step 205 of FIG. 2 a;
  • FIG. 2 c shows a simplified flow chart of one embodiment of step 205 of the sequence compression method for two reading sequences
  • FIG. 3 a shows a simplified flow chart of another embodiment of the sequence compression method for a plurality of reading sequences
  • FIG. 3 b shows a simplified flow chart of one embodiment of step 307 of FIG. 3 a.
  • FIG. 3 c shows a simplified flow chart of one embodiment of step 309 of FIG. 3 a.
  • FIG. 3 d shows a compression method for the plurality of sequences.
  • FIG. 4 shows a comparison method for the plurality of sequences of the invention
  • FIG. 5 shows an illustration for calculating a confidence score of a content of each position
  • FIGS. 6-8 shows other comparison methods for the plurality of sequences of the invention.
  • the invention provides a sequence compression method and a device for performing the sequence compression method.
  • the foundation of the sequence compression method is to compare two sequences.
  • sequence compression method is detailed in the following, in one aspect of the invention.
  • FIG. 1 shows a diagram of one embodiment of a sequence compression device of the invention
  • FIG. 2 a shows a simplified flow chart of one embodiment of the sequence compression method performed by the device.
  • the sequence compression device 100 may comprises a receiving unit 101 , a processor 103 , and a memory 105 .
  • the receiving unit 101 obtains a first reading sequence and a second reading sequence from an identical source (step 201 ).
  • the processor 103 sets a comparison condition (step 203 ). After the comparison condition is set, the processor 103 compares the first reading sequence with the second reading sequence according to the comparison condition to generate a sequence comparison result (step 205 ).
  • the processor 103 outputs a final template sequence according to the sequence comparison result (step 207 ).
  • the final template sequence may be selected from the first reading sequence or the second reading sequence.
  • the final template sequence may be stored in the memory 105 .
  • the processor 103 compares the final template sequence to each of the first and second reading sequences in order to generate a respective difference between the final template sequence and each of the first and second reading sequences (step 209 ).
  • the respective difference may include starting positions, lengths, ending positions, and contents.
  • the processor 103 compresses the first and second reading sequences according to the final template sequences and all generated differences between the final template sequence and the first and second reading sequences in order to generate a compression file (step 211 ).
  • the compression file may have a file format comprising a file header, the final template sequence, and a comparison difference of positions and contents corresponding to all generated differences between the final template sequence and the first and second reading sequences.
  • the processor 103 may set the comparison condition according to a first seed table of the first reading sequence and a second seed table of the second reading sequence.
  • the first seed table of the first reading sequence may comprise a plurality of first seeds with a specific length constituting a plurality of first seed sets with different seeding start sites and the second seed table of the second reading sequence may comprise a plurality of second seeds with a specific length constituting a plurality of second seed sets with different seeding start sites, wherein the specific length of the first seeds of the first seed table and the specific length of the second seeds of the second seed table are of the same specific length.
  • a seed table of a sequence may be built by the processor 103 , wherein a seed is a segment of the sequence.
  • An example of building a seed table of a sequence is detailed in the following.
  • a sequence is divided into a plurality of seeds (or segment) sets from the different start sites of the sequence, respectively, by per seed (or segment) K mers (a specific length of the seeds), wherein K is a positive integer of greater than 2, preferably 2-9, more preferably 3-9 and a content and a position of each seed are recorded, and then a seed table of the sequence is built.
  • the basis for choosing the specific length of the seeds for dividing the sequence may comprise experiences of a user, the length of the sequence or the accuracy of a prior final template sequence from the calibration method of the invention, but not limited thereto, wherein the accuracy of a prior final template sequence may be obtained by comparing a know sequence of a know primer with the final template sequence thereof obtained from the calibration method of the invention.
  • the specific length per seed may be chosen according to experiences of a user.
  • the specific length per seed is chosen according to the length of the sequence.
  • the specific length per seed is chosen according to a prior final template sequence.
  • the sequence is divided into a plurality of seeds from the first base by per seed 4 mers, wherein the plurality of seeds therefrom is called a shift-0 seed set, and the content and a position of each seed are recorded.
  • the sequence is divided into a plurality of seeds from the second base by per seed 4 mers, wherein the plurality of seeds therefrom is called a shift-1 seed set, and the content and a position of each seed are recorded.
  • the sequence is divided into a plurality of seeds from the third base by per seed 4 mers, wherein the plurality of seeds therefrom is called a shift-2 seed set, and a content and a position of each seed are recorded.
  • the sequence is divided into a plurality of seeds from the forth base by per seed 4 mers, wherein the plurality of seeds therefrom is called a shift-3 seed set, and the content and a position of each seed are recorded.
  • a seed table with 4 mer length (4-mer seed table) is built. Note that a seed table with other seed length of the sequence may be built with a similar approach.
  • seed tables with different seed lengths may be built at the same time. Or only a seed table with a specific length of a sequence may be built and the rest of the seed tables with other seed lengths may be built when needed.
  • conditional ordering schedule for comparing the specific seed length tables of the reading sequences in the invention is to first compare the longest seed length tables of the reading sequences, and continue comparisons to the shortest seed length tables of the reading sequences.
  • the processor 103 may compare the first seed table of the first reading sequence with the second seed table of the second reading sequence to generate common fragments and uncommon regions (step 205 a ).
  • One common fragment consists of at least one common seed and is between two uncommon regions without interruption, and the longer the common fragment is, the greater the amount of the common seed contained therein is. All common fragments generated by comparing the first seed table with the second seed table form a common fragment set.
  • the common seed is defined as the seed of the first reading sequence and the seed of the second reading sequence, when the content of a seed of the first reading sequence and a seed of the second reading sequence at a corresponding region or a region close to the corresponding region are equivalent.
  • the processor 103 determines a coverage rate of the common fragment set to the first reading sequence or the second reading sequence (step 205 b ). After that, when the value of the coverage rate satisfies a predetermined value, the processor 103 generates the sequence comparison result from the common fragment set (step 205 c ).
  • the value of the predetermined value is not limited, and may be 80-95%, or preferably 95%.
  • the processor 103 changes the specific length of the first seeds constituting the first seed table of the first reading sequence and the specific length of the second seeds constituting the second seed table of the second reading sequence (i.e. changing the seed table of the first reading sequence with the specific seed length used in the comparison to the other seed table of the first reading sequence with the other specific seed and changing the seed table of the second reading sequence with the specific seed length used in the comparison to the other seed table of the second reading sequence with the other specific seed)) (step 205 d ).
  • the processor 103 compares the first seed table constituted by the first seeds with the changed specific length with the second seed table constituted by the second seeds with the changed specific length at the uncommon regions (step 205 a ) to generate second common fragments and second uncommon regions, wherein the second common fragments and the first common fragment set constitute a second common fragment set, determines a coverage rate of the second common fragment set to the first reading sequence or the second reading sequence (step 205 b ) and generates the sequence comparison result generated by the second common fragment set (step 205 c ) when the value of the coverage rate satisfies a predetermined value.
  • the processor 103 changes the first seed table of the first reading sequence and the second seed table of the second reading sequence (i.e. continuing to perform comparisons of the specific seed length tables of the reading sequences according the conditional ordering schedule, until a value of the coverage rate of the specific seed length tables of the reading sequences does satisfy the predetermined value.) (repeating steps 205 a , 205 b and 205 d ) until the value of the coverage rate satisfies the predetermined value, and then generates the sequence comparison result generated by the second common fragment set (step 205 c )
  • the processor 103 adjusts the uncommon regions by the minimum base-shift principle ( 205 e ) and generates the sequence comparison result from the adjusted common fragment set and the uncommon regions ( 205 f ).
  • the value of the predetermined value is not limited, and may be 80-95%, or preferably 95%.
  • the minimum base-shift principle may comprise the following procedures.
  • each uncommon region is divided into shorter seed sets, and the alignment position of each base of a first reading sequence and the second reading sequence of each shorter seed set is shifted, so that, when compared, the greatest amount of bases of the first reading sequence and the second reading sequence is equivalently aligned, wherein there is at least one alignment manner for each shorter seed set.
  • a positive score is given for each of the equivalently aligned bases of each shorter seed set and a negative score or no score is given for each of the non-equivalently aligned bases of each shorter seed set.
  • a total score for each shorter seed set of the uncommon region is calculated and the alignment manner of the shorter seed set of the uncommon region with the highest score is selected.
  • one of the conditions for adjusting the uncommon regions by the minimum base-shift principle may be, to make no adjustment, when a length of an uncommon region for the first reading sequence is different from the second reading. In another condition, adjusting the uncommon regions is performed in all cases.
  • seeds may be used from long seed length (shorter than the specific length) to short seed length (shorter than the specific length), or when adjusting the uncommon regions by the minimum base-shift principle, short seeds (shorter than the specific length) may be used for locally optimum solution.
  • the processor 103 changes the specific length of the first seeds constituting the first seed table of the first reading sequence and the specific length of the second seeds constituting the second seed table of the second reading sequence (i.e. changing the seed table of the first reading sequence with the specific seed length used in the comparison to the other seed table of the first reading sequence with the other specific seed and changing the seed table of the second reading sequence with the specific seed length used in the comparison to the other seed table of the second reading sequence with the other specific seed) (step 205 d ).
  • the processor 103 compares the first seed table constituted by the first seeds with the changed specific length with the second seed table constituted by the second seeds with the changed specific length at the uncommon regions (step 205 a ) to generate second common fragments and second uncommon regions, wherein the second common fragments and the first common fragment set constitute a second common fragment set. Subsequently, the processor 103 determines a coverage rate of the second common fragment set to the first reading sequence or the second reading sequence (step 205 b ). Then the processor 103 adjusts the uncommon regions by the minimum base-shift principle when the value of the coverage rate satisfies the predetermined value ( 205 e ) and generates the sequence comparison result generated by the second common fragment set and the uncommon regions which are adjusted ( 205 f ).
  • the processor 103 changes of the first seed table of the first reading sequence and the second seed table of the second reading sequence (i.e. continuing to perform comparisons of the specific seed length tables of the reading sequences according the conditional ordering schedule, until a value of the coverage rate of the specific seed length tables of the reading sequences does satisfy the predetermined value.) (repeating steps 205 a , 250 b and 205 d ) until the coverage rate satisfies the predetermined value, and then adjusts the uncommon regions by the minimum base-shift principle when the value of the coverage rate satisfies the predetermined value ( 205 e ).
  • the processor 103 generates the sequence comparison result generated by the second common fragment set and the uncommon regions which are adjusted ( 205 f ). Then, the processor 103 outputs a final template sequence according to the sequence comparison result (step 207 ).
  • the first reading sequence and the second reading sequence may be read from a single sequence.
  • the single sequence is a concatenate sequence.
  • the concatenate sequence may be read from a circle sequence, which has a known sequence part, such as a primer, and an unknown sequence part.
  • the concatenate sequence may have primer-DNA repeat patterns.
  • primer-DNA DNA segment with connected primer
  • the seed tables of the primer and the seed tables sequence may be built first, and then the primer sequence is compared to possible positions in the concatenate sequences with the seed tables with longest seeds to locate the exact positions of the primers for retrieving the DNA segments. After that, the sequences of the DNA segments are obtained.
  • sequence compression method for a plurality of sequences is detailed in the following, in another aspect of the invention.
  • FIG. 1 shows a diagram of one embodiment of a sequence compression device of the invention and FIG. 3 shows a simplified flow chart of one embodiment of the sequence compression method performed by the device.
  • the sequence compression device 100 may comprises a receiving unit 101 and a processor 103 .
  • the receiving unit 101 obtains a plurality of reading sequences from an identical source by a receiving unit (step 301 ).
  • the processor 103 selects one of the plurality of reading sequences as an initial template sequence (step 303 ).
  • the processor 103 sets a comparison condition (step 305 ).
  • the method to select the initial template sequence from the plurality of reading sequences may comprise: (i) selecting the longest reading sequence among the plurality of reading sequences as the initial template sequence; (ii) selecting the reading sequence having a length which is closest to the average length of the plurality of reading sequences as the initial template sequence; (iii) selecting the reading sequence having a length which has the highest number of occurrence, among the plurality of reading sequences as the initial template sequence; or (iv) randomly selecting the reading sequence among the input sequences as the initial template sequence.
  • the processor 103 compares the initial template sequence to each of the other sequences according to the comparison condition, to respectively generate comparison results (step 307 ).
  • the comparison method for the plurality of sequences mentioned above is illustrated as FIG. 4 .
  • S 1 to S 9 represent different reading sequences, wherein S 1 is selected as an initial template sequence.
  • the processor 103 generates a sequence comparison result according to all respectively generated comparison results (step 309 ).
  • the processor 103 outputs a final template sequence according to the sequence comparison result (step 311 ).
  • the final template sequence may be updated during the comparison process.
  • the final template sequence may be stored in the memory 105 .
  • the processor 103 compares the final template sequence to each of the plurality of reading sequences in order to generate a respective difference between the final template sequence and each of the plurality of reading sequences (step 313 ).
  • the processor 103 compares all the versions of the final template sequence to each of the plurality of reading sequences to generate a respective difference of the plurality of reading sequences process corresponding to different versions of the final template sequence.
  • the respective difference may include starting positions, lengths, ending positions, and contents.
  • the processor 103 compresses the plurality of reading sequences according to the final template sequences and all generated differences between the final template sequence and the plurality of reading sequences in order to generate a compression file (step 315 ).
  • the compression file may have a file format comprising a file header, the final template sequence, and a comparison difference of positions and contents corresponding to all generated differences between the final template sequence and the plurality of reading sequences.
  • the processor 103 may set the comparison condition according to a first seed table of the initial template sequence and second seed tables for reading sequences which are not selected.
  • the first seed table of the initial template sequence may comprise a plurality of first seeds with a specific length constituting a plurality of first seed sets with different seeding start sites and the second seed table of the reading sequence which is not selected may comprise a plurality of second seeds with a specific length constituting a plurality of second seed sets with different seeding start sites, wherein the specific length of the first seeds of the first seed table and the specific length of the second seeds of the second seed table are of the same specific length.
  • a seed table of a sequence may be built by the processor 103 .
  • Definitions for a seed, a seed set and a seed table are the same as mentioned above.
  • the approach for building a seed table is also the same as mentioned above.
  • the seed tables with different seed lengths (from the longest seed length need to the shortest seed length (2 mers)) of a sequence may be built at the same time. Or only a seed table with a specific length of a sequence may be built and the rest of the seed tables with other seed lengths may be built when needed. Moreover, the seed tables of two sequences which are to be compared are built first and the rest of the seed tables may be built when needed.
  • the processor 103 when the processor 103 compares the initial template sequence with the each of the other sequences according to the comparison condition, to respectively generate comparison results (step 307 ), in comparing the initial template sequence with one reading sequence which is not selected, the processor 103 may compare the first seed table of the initial template sequence with the second seed table of the reading sequence which is not selected to generate common fragments and uncommon regions as the comparison result (step 307 a ).
  • One common fragment consists of at least one common seed and is between two uncommon regions without interruption, and the longer the common fragment is, the greater the amount of the common seed contained therein is. All common fragments generated by comparing the first seed table with the second seed table form a common fragment set.
  • the common seed is defined as the seed of the initial template sequence and the seed of the reading sequence which is not selected, when the content of a seed of the initial template sequence and a seed of the reading sequence which is not selected at a corresponding region or a region close to the corresponding region are equivalent.
  • the processor 103 determines a coverage rate of the common fragment set to the initial template sequence or the reading sequence which is not selected (step 307 b ). When the value of the coverage rate satisfies a predetermined value, the processor 103 uses the common fragments to generating sequence comparison results according to all respectively generated comparison results (step 309 ).
  • the value of the predetermined value is not limited, and may be 80-95%, or preferably 95%.
  • the processor 103 changes the specific length of the first seeds constituting the first seed table of the initial template sequence and the specific length of the second seeds constituting the second seed table of the reading sequence which is not selected (i.e. continuing to perform comparisons of the specific seed length tables of the reading sequences according the conditional ordering schedule, until a value of the coverage rate of the specific seed length tables of the reading sequences does satisfy the predetermined value.) (step 307 c ).
  • the processor 103 compares the first seed table constituted by the first seeds with the changed specific length with the second seed table constituted by the second seeds with the changed specific length at the uncommon regions (step 307 a ) to generate a second common fragments and second uncommon regions, wherein the second common fragments and the first common fragment set constitute a second common fragment set, determines a coverage rate of the second common fragment set to the initial template sequence or the reading sequence which is not selected (step 307 b ) and uses the second common fragments to generate sequence comparison results according to all respectively generated comparison results (step 309 ) when the value of the coverage rate satisfies a predetermined value.
  • the processor 103 changes the first seed table of the initial template sequence and the second seed table of the reading sequence which is not selected (i.e. continuing to perform comparisons of the specific seed length tables of the reading sequences according the conditional ordering schedule, until a value of the coverage rate of the specific seed length tables of the reading sequences does satisfy the predetermined value.) (repeating steps 307 a , 307 b and 307 c ) until the coverage rate satisfies the predetermined value, and then uses the second common fragments to generate a sequence comparison results according to all respectively generated comparison results (step 309 ).
  • Procedures for generating sequence comparison results according to all respectively generated comparison results may comprise the following (see FIG. 3 c ).
  • the processor 103 registers all positions of all common fragments obtained from generating sequence comparison results according to all respectively generated comparison results (step 307 ) with the proper positions in the initial template sequence (step 309 a ). Then, the processor 103 calculates a confidence score of a content of each base corresponding to the respective bases of the initial template sequence according to all common fragments (step 309 b ). Next, the processor 103 sets the base in the initial template sequence as a determined position when the confidence score thereof satisfies a specific score and sets the base in the initial template sequence as a undetermined position when the confidence score thereof does not satisfy a specific score (step 309 c ).
  • FIG. 5 An illustration for calculating a confidence score of a content of each position is shown in FIG. 5
  • Pi and Pj are two positions corresponding to the template.
  • fa-fe are common fragments generated from comparing two sequences.
  • the confidence scores of fa-fe are a-e, respectively.
  • the confidence score of each position is represented by
  • C P X ⁇ fx .
  • the processor 103 After, the processor 103 generates the sequence comparison result according to all bases which are set as determined positions and all bases which are set as undetermined positions in the initial template sequence (step 309 d ). Subsequently, the processor 103 determines a completed ratio for all of the determined positions to the sequence comparison result (step 309 e ). Next, when the completed ratio satisfies a specific threshold, the processor 103 uses the sequence comparison result to output a final template sequence according to the sequence comparison result (step 311 ).
  • the value of the specific threshold is not limited, and may be 80-95%, or preferably 95%.
  • the processor 103 repeats the steps 303 , 305 and 307 , wherein a new template sequence is selected from the plurality of reading sequences without the first template and the first template is stopped from being compared, and wherein new common fragments and new uncommon regions are generated from comparing the new template sequence with the other reading sequences.
  • the processor 103 registers all positions of all new common fragments with the proper positions in the sequence comparison result (step 309 a ), calculates a confidence score of a content of each undetermined positions corresponding to the sequence comparison result according to the new common fragments which correspond to the positions of the undetermined positions (step 309 b ).
  • the processor 103 sets each base of the undetermined positions in the sequence comparison result as a new determined position when the confidence score thereof satisfies a specific score and still set the base in the undetermined positions as a undetermined position when the confidence score thereof does not satisfy a specific score (step 309 c ) and generates a new sequence comparison result by the sequence comparison result and the new determined positions (step 309 d ).
  • the processor 103 determines a completed ratio of all the determined positions to the new sequence comparison result. When the completed ratio satisfies the specific threshold, the new sequence comparison result is used to output a final template sequence (step 311 ). The processor 103 outputs a final template sequence according to new sequence comparison result.
  • the processor 103 may adjust the undetermined positions of the sequence comparison result by a minimum base-shift principle before outputting a final template sequence (step 311 ).
  • the procedures and conditions for the minimum base-shift principle are the same as that mentioned above.
  • the compression method for the plurality of sequences mentioned above is illustrated as FIG. 3 d .
  • Labels P 1 -Pn represent the plurality of reading sequences.
  • a final template sequence Pf is output according to the sequence comparison result.
  • the processor 103 compares the final template sequence Pf with the reading sequences P 1 -Pn, and respectively generates differences D 1 -Dn between the final template sequence Pf and the reading sequences P 1 -Pn. Then, the processor 103 may compress the plurality of reading sequences just by way of storing the final template sequence Pf and all generated differences D 1 -Dn.
  • the compression file may comprise the final template sequence Pf and all generated differences D 1 -Dn, not all reading sequences P 1 -Pn. Therefore, the compression method can save a lot of capacity of storage.
  • FIGS. 6-8 show different methods for comparing the plurality of sequences in the sequence compression method of the invention.
  • S 1 to S 12 represent different reading sequences.
  • CR 1 to CR 13 represent different sequence comparison results generated from different comparison orders.
  • C represents an outputted final template sequence.
  • the plurality of reading sequences may be read from a single sequence.
  • the single sequence is a concatenate sequence.
  • the concatenate sequence may be read from a circle sequence, which has a known sequence part, such as a primer, and an unknown sequence part.
  • the concatenate sequence may have primer-DNA repeat patterns. The method to retrieve DNA fragments is similar to that which was mentioned above.

Landscapes

  • Life Sciences & Earth Sciences (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Engineering & Computer Science (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Biophysics (AREA)
  • Theoretical Computer Science (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Biotechnology (AREA)
  • Evolutionary Biology (AREA)
  • Spectroscopy & Molecular Physics (AREA)
  • Proteomics, Peptides & Aminoacids (AREA)
  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Genetics & Genomics (AREA)
  • Bioethics (AREA)
  • Databases & Information Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Signal Processing For Digital Recording And Reproducing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
US12/977,457 2009-12-23 2010-12-23 Method and apparatus for compressing nucleotide sequence data Active 2031-01-18 US8223043B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/977,457 US8223043B2 (en) 2009-12-23 2010-12-23 Method and apparatus for compressing nucleotide sequence data

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US28216809P 2009-12-23 2009-12-23
US33055210P 2010-05-03 2010-05-03
US12/977,457 US8223043B2 (en) 2009-12-23 2010-12-23 Method and apparatus for compressing nucleotide sequence data

Publications (2)

Publication Number Publication Date
US20110163898A1 US20110163898A1 (en) 2011-07-07
US8223043B2 true US8223043B2 (en) 2012-07-17

Family

ID=44194959

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/977,457 Active 2031-01-18 US8223043B2 (en) 2009-12-23 2010-12-23 Method and apparatus for compressing nucleotide sequence data

Country Status (5)

Country Link
US (1) US8223043B2 (fr)
EP (1) EP2460111B1 (fr)
CN (1) CN102576388B (fr)
TW (1) TWI443544B (fr)
WO (1) WO2011076130A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105760706A (zh) * 2014-12-15 2016-07-13 深圳华大基因研究院 一种二代测序数据的压缩方法

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8751166B2 (en) * 2012-03-23 2014-06-10 International Business Machines Corporation Parallelization of surprisal data reduction and genome construction from genetic data for transmission, storage, and analysis
US8812243B2 (en) 2012-05-09 2014-08-19 International Business Machines Corporation Transmission and compression of genetic data
US8855938B2 (en) 2012-05-18 2014-10-07 International Business Machines Corporation Minimization of surprisal data through application of hierarchy of reference genomes
US10353869B2 (en) * 2012-05-18 2019-07-16 International Business Machines Corporation Minimization of surprisal data through application of hierarchy filter pattern
US8972406B2 (en) 2012-06-29 2015-03-03 International Business Machines Corporation Generating epigenetic cohorts through clustering of epigenetic surprisal data based on parameters
US9002888B2 (en) 2012-06-29 2015-04-07 International Business Machines Corporation Minimization of epigenetic surprisal data of epigenetic data within a time series
CN103546162B (zh) * 2013-09-22 2016-08-17 上海交通大学 基于非连续上下文建模和最大熵原则的基因压缩方法
WO2016202918A1 (fr) * 2015-06-16 2016-12-22 Gottfried Wilhelm Leibniz Universität Hannover Procédé de compression de données génomiques
CN106027521B (zh) * 2016-05-19 2019-11-01 华为技术有限公司 压缩方法、解压方法、压缩装置和解压装置
CN108018607B (zh) * 2016-10-28 2021-04-27 深圳华大基因股份有限公司 一种提升测序平台文库拆分率的标签序列混库方法和装置
WO2018103490A1 (fr) * 2016-12-06 2018-06-14 Authpaper Limited Procédé et système de compression de données
CN109450452B (zh) * 2018-11-27 2020-07-10 中国科学院计算技术研究所 一种针对基因数据的取样字典树索引的压缩方法和系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004074990A2 (fr) 2003-02-14 2004-09-02 Eidogen Inc. Procede pour determiner la signification d'un alignement de sequences
WO2004097369A2 (fr) 2003-04-25 2004-11-11 Sequenom, Inc. Procedes et systemes de fragmentation et systemes de sequençage de novo
US7141419B2 (en) * 2000-05-15 2006-11-28 Icagen, Inc. Isolated nucleic acids encoding cyclic nucleotide-gated cation channel subunit 3B (CNG3B) polypeptides
CN101430742A (zh) 2008-12-12 2009-05-13 深圳华大基因研究院 一种短序列组装中构建图的方法及系统

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040153255A1 (en) * 2003-02-03 2004-08-05 Ahn Tae-Jin Apparatus and method for encoding DNA sequence, and computer readable medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7141419B2 (en) * 2000-05-15 2006-11-28 Icagen, Inc. Isolated nucleic acids encoding cyclic nucleotide-gated cation channel subunit 3B (CNG3B) polypeptides
WO2004074990A2 (fr) 2003-02-14 2004-09-02 Eidogen Inc. Procede pour determiner la signification d'un alignement de sequences
WO2004097369A2 (fr) 2003-04-25 2004-11-11 Sequenom, Inc. Procedes et systemes de fragmentation et systemes de sequençage de novo
CN101430742A (zh) 2008-12-12 2009-05-13 深圳华大基因研究院 一种短序列组装中构建图的方法及系统

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Flicek et al., "Sense from sequence reads: methods for alignment and assembly", Nature Methods Supplement, vol. 6, No. 11s, Nov. 2009 (Published Online Oct. 15, 2009), pp. S6-S12.
Huo et al., "A Multiple Alignment Approach for DNA Sequences Based on the Maximum Weighted Path Algorithms", Journal of Software, vol. 18, No. 2, Feb. 2007, pp. 185-195.
Zerbino et al., "Velvet: Algorithms for de novo short read assembly using de Bruijn graphs", Genome Research, vol. 18, Mar. 18, 2008, pp. 821-829.
Zhang et al., "An Eulerian Path Approach to Global Multiple Alignment for DNA Sequences", Journal of Computational Biology, vol. 10, No. 6, 2003, pp. 803-819.

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105760706A (zh) * 2014-12-15 2016-07-13 深圳华大基因研究院 一种二代测序数据的压缩方法
CN105760706B (zh) * 2014-12-15 2018-05-29 深圳华大基因研究院 一种二代测序数据的压缩方法

Also Published As

Publication number Publication date
EP2460111B1 (fr) 2018-10-31
TWI443544B (zh) 2014-07-01
TW201140365A (en) 2011-11-16
WO2011076130A1 (fr) 2011-06-30
US20110163898A1 (en) 2011-07-07
CN102576388A (zh) 2012-07-11
EP2460111A1 (fr) 2012-06-06
EP2460111A4 (fr) 2015-12-02
WO2011076130A8 (fr) 2011-09-15
CN102576388B (zh) 2014-10-08

Similar Documents

Publication Publication Date Title
US8223043B2 (en) Method and apparatus for compressing nucleotide sequence data
US9929746B2 (en) Methods and systems for data analysis and compression
US8700340B2 (en) Sequence calibration method and sequence calibration device
US8798936B2 (en) Methods and systems for data analysis using the Burrows Wheeler transform
CN105845115B (zh) 歌曲调式确定方法及歌曲调式确定装置
US9245508B2 (en) Music piece order determination device, music piece order determination method, and music piece order determination program
Gontarz et al. SRmapper: a fast and sensitive genome-hashing alignment tool
EP2650875B1 (fr) Détermination d'ordre de pistes musicales au moyen d 'une table de corrélation des temps entre segments.
CN115668384A (zh) 质量分数压缩
WO2020084404A1 (fr) Système et procédé de recherche et de mappage de sous-séquence directe dans un signal brut de nanopore
EP3093781B1 (fr) Système et procédé de transformation de la génomique et de compression de données
US10727863B2 (en) Data compression device and data compression method
Selva et al. SRComp: short read sequence compression using burstsort and Elias omega coding
US11244742B2 (en) System for generating genomics data, with adjusted quality scores, and device, method, and software product for use therein
KR20220089211A (ko) 문자 빈도 기반 서열 재정렬을 통한 fastq 데이터 압축 방법 및 장치
AU2020398180A1 (en) Rapid detection of gene fusions
Długosz et al. Improvements in DNA reads correction
JP2012203382A (ja) 特定音響信号含有区間検出装置、方法、及びプログラム
Nazari et al. GeneSqueeze: A Novel Lossless, Reference-Free Compression Algorithm for FASTQ/A Files
Steere et al. CAN-zip–Centroid Based Delta Compression of Next Generation Sequencing Data
Jugas et al. Overlap detection for a genome assembly based on genomic signal processing
CN115708153A (zh) 修正音频的节奏的方法和装置
CN114341988A (zh) 用于压缩基因组序列数据的方法
Anderson et al. Technical Report: An n-free-passes CYK algorithm for error-correction and the prediction of non-canonical base-pairs in RNA secondary structure

Legal Events

Date Code Title Description
AS Assignment

Owner name: INDUSTRIAL TECHNOLOGY RESEARCH INSTITUTE, TAIWAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HWANG, BAI-KUANG;FANN, JENN-YEH;CHIOU, CHUNG-FAN;REEL/FRAME:025537/0714

Effective date: 20101220

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12